./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65401fe061f89bb729dffabf74050dfab9fe7d77 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:07,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:07,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:07,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:07,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:07,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:07,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:07,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:07,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:07,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:07,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:07,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:07,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:07,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:07,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:07,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:07,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:07,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:07,647 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:07,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:07,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:07,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:07,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:07,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:07,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:07,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:07,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:07,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:07,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:07,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:07,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:07,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:07,668 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:07,669 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:07,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:07,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:07,672 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:07,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:07,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:07,706 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:07,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:07,707 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:07,707 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:07,707 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:07,707 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:07,708 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:07,708 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:07,708 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:07,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:07,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:07,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:07,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:07,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:07,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:07,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:07,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:07,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:07,710 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:07,710 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:07,710 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:07,710 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:07,710 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:07,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:07,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:07,711 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:07,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:07,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:07,711 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:07,712 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:07,712 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65401fe061f89bb729dffabf74050dfab9fe7d77 [2018-11-29 00:11:07,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:07,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:07,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:07,765 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:07,765 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:07,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:07,822 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41244bb39/0d765b876b1c4f2b81b7bc6e3042dc92/FLAG27423f9dd [2018-11-29 00:11:08,355 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:08,356 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:08,369 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41244bb39/0d765b876b1c4f2b81b7bc6e3042dc92/FLAG27423f9dd [2018-11-29 00:11:08,608 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41244bb39/0d765b876b1c4f2b81b7bc6e3042dc92 [2018-11-29 00:11:08,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:08,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:08,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:08,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:08,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:08,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:08,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e3ec09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:08, skipping insertion in model container [2018-11-29 00:11:08,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:08" (1/1) ... [2018-11-29 00:11:08,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:08,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:09,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:09,069 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:09,121 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:09,191 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:09,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09 WrapperNode [2018-11-29 00:11:09,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:09,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:09,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:09,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:09,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:09,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:09,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:09,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:09,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... [2018-11-29 00:11:09,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:09,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:09,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:09,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:09,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:09,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:09,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:09,813 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:09,813 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:09,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:09 BoogieIcfgContainer [2018-11-29 00:11:09,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:09,815 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:09,815 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:09,819 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:09,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:09,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:08" (1/3) ... [2018-11-29 00:11:09,821 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28dd40d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:09, skipping insertion in model container [2018-11-29 00:11:09,821 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:09,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:09" (2/3) ... [2018-11-29 00:11:09,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28dd40d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:09, skipping insertion in model container [2018-11-29 00:11:09,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:09,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:09" (3/3) ... [2018-11-29 00:11:09,824 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:09,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:09,886 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:09,886 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:09,886 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:09,886 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:09,886 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:09,886 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:09,887 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:09,887 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:09,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-29 00:11:09,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:09,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:09,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:09,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:09,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:09,936 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:09,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-29 00:11:09,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:09,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:09,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:09,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:09,939 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:09,947 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-11-29 00:11:09,948 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-11-29 00:11:09,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-29 00:11:09,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:09,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-11-29 00:11:10,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:10,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:10,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:10,124 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:10,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:11:10,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:11:10,143 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-29 00:11:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:10,150 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-29 00:11:10,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:11:10,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-29 00:11:10,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:10,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-11-29 00:11:10,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:11:10,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:11:10,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-29 00:11:10,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:10,162 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-29 00:11:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-29 00:11:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-29 00:11:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:11:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-11-29 00:11:10,194 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-29 00:11:10,194 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-29 00:11:10,194 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:10,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-11-29 00:11:10,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:10,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:10,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:10,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:10,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:10,201 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-11-29 00:11:10,201 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-11-29 00:11:10,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-29 00:11:10,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:10,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:10,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,232 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-11-29 00:11:10,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:10,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:10,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:10,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:10,317 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:10,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:11:10,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:11:10,318 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-29 00:11:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:10,453 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-11-29 00:11:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:11:10,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2018-11-29 00:11:10,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:11:10,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2018-11-29 00:11:10,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-29 00:11:10,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:11:10,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-29 00:11:10,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:10,459 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-29 00:11:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-29 00:11:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-29 00:11:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-29 00:11:10,461 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:10,461 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:10,461 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:10,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-29 00:11:10,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:11:10,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:10,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:10,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:10,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:10,464 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-11-29 00:11:10,464 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-11-29 00:11:10,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,465 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-29 00:11:10,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2018-11-29 00:11:10,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:10,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2018-11-29 00:11:10,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:10,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:11,062 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-11-29 00:11:11,389 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-29 00:11:11,569 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-29 00:11:11,592 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:11,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:11,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:11,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:11,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:11,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:11,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:11,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:11,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-29 00:11:11,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:11,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:11,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,203 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-29 00:11:12,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,700 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-29 00:11:12,837 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:12,842 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:12,845 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-11-29 00:11:12,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,860 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-11-29 00:11:12,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,869 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-11-29 00:11:12,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,937 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:13,002 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:11:13,002 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:11:13,005 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:13,007 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:13,007 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:13,008 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-11-29 00:11:13,074 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:11:13,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:13,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:13,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:11:13,205 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-11-29 00:11:13,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-29 00:11:13,245 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-11-29 00:11:13,247 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-11-29 00:11:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-29 00:11:13,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-29 00:11:13,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:13,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-29 00:11:13,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:13,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-29 00:11:13,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:13,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-29 00:11:13,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:13,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2018-11-29 00:11:13,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:11:13,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:11:13,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2018-11-29 00:11:13,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:13,258 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-29 00:11:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2018-11-29 00:11:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-29 00:11:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-29 00:11:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-29 00:11:13,260 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-29 00:11:13,260 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-29 00:11:13,261 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:13,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-29 00:11:13,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:13,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:13,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:13,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:13,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:13,263 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-11-29 00:11:13,263 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-11-29 00:11:13,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-29 00:11:13,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:13,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:13,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-29 00:11:13,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:13,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:13,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-29 00:11:13,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:13,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,507 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-29 00:11:13,628 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-29 00:11:13,795 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-29 00:11:13,863 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:13,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:13,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:13,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:13,864 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:13,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:13,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:13,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:13,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-29 00:11:13,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:13,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:13,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,035 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-29 00:11:14,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,550 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-29 00:11:14,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:14,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:14,602 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-11-29 00:11:14,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,607 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-11-29 00:11:14,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,613 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-11-29 00:11:14,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,621 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-11-29 00:11:14,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,626 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-11-29 00:11:14,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,631 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-11-29 00:11:14,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,639 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-11-29 00:11:14,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,651 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-11-29 00:11:14,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,652 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:14,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,657 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:14,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,676 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-11-29 00:11:14,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,688 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-11-29 00:11:14,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,700 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-11-29 00:11:14,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:14,774 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:14,775 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:11:14,775 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:14,776 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:14,777 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:14,778 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-11-29 00:11:14,877 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:11:14,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:14,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:14,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:14,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:15,070 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-11-29 00:11:15,071 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-29 00:11:15,119 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-11-29 00:11:15,120 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-11-29 00:11:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:11:15,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-29 00:11:15,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-29 00:11:15,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-29 00:11:15,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2018-11-29 00:11:15,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:15,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2018-11-29 00:11:15,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:11:15,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:11:15,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2018-11-29 00:11:15,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:15,127 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-29 00:11:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2018-11-29 00:11:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-11-29 00:11:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-29 00:11:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-29 00:11:15,131 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-29 00:11:15,131 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-29 00:11:15,131 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:11:15,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-29 00:11:15,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:15,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:15,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:15,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:15,132 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:15,133 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-11-29 00:11:15,133 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-11-29 00:11:15,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-11-29 00:11:15,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:15,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:15,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-29 00:11:15,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:15,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:15,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:15,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-29 00:11:15,563 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:15,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-29 00:11:15,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:15,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:15,734 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-29 00:11:15,880 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-29 00:11:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:11:15,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:11:15,881 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-29 00:11:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:15,950 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-11-29 00:11:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:11:15,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-29 00:11:15,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:15,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2018-11-29 00:11:15,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-29 00:11:15,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-29 00:11:15,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-29 00:11:15,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:15,957 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-29 00:11:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-29 00:11:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-29 00:11:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:11:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-29 00:11:15,960 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:11:15,960 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:11:15,961 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:11:15,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-29 00:11:15,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:15,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:15,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:15,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:15,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:15,963 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-11-29 00:11:15,963 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-11-29 00:11:15,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-11-29 00:11:15,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:15,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:15,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-29 00:11:15,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:15,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2018-11-29 00:11:15,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:15,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:17,206 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-29 00:11:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:17,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:17,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-29 00:11:17,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:17,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:17,583 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-11-29 00:11:17,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-29 00:11:17,591 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-11-29 00:11:17,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:11:17,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:11:17,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:11:17,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-29 00:11:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-29 00:11:17,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:17,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-29 00:11:17,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-29 00:11:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-11-29 00:11:17,719 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 19 states. [2018-11-29 00:11:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:18,462 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-29 00:11:18,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-29 00:11:18,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-11-29 00:11:18,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-29 00:11:18,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2018-11-29 00:11:18,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-29 00:11:18,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-29 00:11:18,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2018-11-29 00:11:18,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:18,471 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2018-11-29 00:11:18,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2018-11-29 00:11:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-11-29 00:11:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-29 00:11:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-29 00:11:18,476 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-29 00:11:18,476 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-29 00:11:18,476 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:11:18,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-29 00:11:18,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-29 00:11:18,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:18,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:18,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:18,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:18,480 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-11-29 00:11:18,480 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-11-29 00:11:18,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2018-11-29 00:11:18,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:18,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:18,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:18,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-11-29 00:11:18,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:18,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:18,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:18,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2018-11-29 00:11:18,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:18,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:18,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:18,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:18,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:18,953 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-29 00:11:19,303 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2018-11-29 00:11:19,397 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:19,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:19,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:19,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:19,398 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:19,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:19,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:19,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:19,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-29 00:11:19,398 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:19,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:19,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,602 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-11-29 00:11:19,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:20,177 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:20,178 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:20,178 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-11-29 00:11:20,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:20,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:20,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:20,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:20,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:20,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:20,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:20,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:20,184 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-11-29 00:11:20,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:20,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:20,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:20,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:20,189 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:20,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:20,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:20,197 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-11-29 00:11:20,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:20,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:20,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:20,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:20,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:20,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:20,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:20,207 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-11-29 00:11:20,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:20,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:20,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:20,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:20,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:20,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:20,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:20,221 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-11-29 00:11:20,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:20,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:20,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:20,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:20,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:20,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:20,243 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:20,274 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-29 00:11:20,275 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:11:20,276 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:20,277 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:20,278 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:20,278 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-11-29 00:11:20,415 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-29 00:11:20,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:20,519 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-11-29 00:11:20,519 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-29 00:11:20,593 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-11-29 00:11:20,595 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-11-29 00:11:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:11:20,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:11:20,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,596 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:20,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:20,670 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-11-29 00:11:20,670 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-29 00:11:20,692 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-11-29 00:11:20,696 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-11-29 00:11:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:11:20,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:11:20,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,698 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:20,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:20,742 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-11-29 00:11:20,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-29 00:11:20,764 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-11-29 00:11:20,766 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-11-29 00:11:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-29 00:11:20,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:11:20,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-29 00:11:20,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-29 00:11:20,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2018-11-29 00:11:20,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:20,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2018-11-29 00:11:20,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:20,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:20,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:20,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:20,773 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:20,773 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:20,773 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:20,773 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:11:20,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:20,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:20,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:20,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:20 BoogieIcfgContainer [2018-11-29 00:11:20,783 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:20,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:20,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:20,783 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:20,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:09" (3/4) ... [2018-11-29 00:11:20,788 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:20,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:20,789 INFO L168 Benchmark]: Toolchain (without parser) took 12177.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -246.8 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,791 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:20,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,795 INFO L168 Benchmark]: Boogie Preprocessor took 31.13 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-11-29 00:11:20,795 INFO L168 Benchmark]: RCFGBuilder took 462.25 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,797 INFO L168 Benchmark]: BuchiAutomizer took 10968.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.3 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,798 INFO L168 Benchmark]: Witness Printer took 5.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:20,804 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 578.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.13 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 462.25 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10968.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.3 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.40 ms. Allocated memory is still 1.3 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 10.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.2s. 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.5s 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: 23ms 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...