./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c685955ff6c809f32f6abe44f773ce6a6ae39f94 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:27:36,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:27:36,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:27:36,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:27:36,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:27:36,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:27:36,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:27:36,575 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:27:36,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:27:36,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:27:36,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:27:36,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:27:36,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:27:36,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:27:36,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:27:36,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:27:36,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:27:36,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:27:36,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:27:36,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:27:36,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:27:36,586 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:27:36,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:27:36,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:27:36,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:27:36,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:27:36,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:27:36,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:27:36,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:27:36,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:27:36,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:27:36,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:27:36,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:27:36,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:27:36,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:27:36,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:27:36,594 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:27:36,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:27:36,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:27:36,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:27:36,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:27:36,606 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:27:36,606 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:27:36,606 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:27:36,607 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:27:36,607 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:27:36,607 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:27:36,607 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:27:36,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:27:36,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:27:36,607 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:27:36,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:27:36,609 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:27:36,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:27:36,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:27:36,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:27:36,609 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:27:36,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:27:36,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:27:36,610 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:27:36,610 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:27:36,610 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c685955ff6c809f32f6abe44f773ce6a6ae39f94 [2018-11-10 05:27:36,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:27:36,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:27:36,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:27:36,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:27:36,646 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:27:36,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:27:36,689 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/data/06e30b087/af571ae620a8498f910d1ea4268170c3/FLAGcab7c7306 [2018-11-10 05:27:37,123 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:27:37,124 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:27:37,132 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/data/06e30b087/af571ae620a8498f910d1ea4268170c3/FLAGcab7c7306 [2018-11-10 05:27:37,140 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/data/06e30b087/af571ae620a8498f910d1ea4268170c3 [2018-11-10 05:27:37,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:27:37,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:27:37,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:37,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:27:37,145 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:27:37,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df4f6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37, skipping insertion in model container [2018-11-10 05:27:37,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:27:37,181 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:27:37,349 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:37,358 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:27:37,383 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:37,409 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:27:37,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37 WrapperNode [2018-11-10 05:27:37,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:37,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:27:37,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:27:37,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:27:37,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:27:37,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:27:37,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:27:37,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:27:37,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... [2018-11-10 05:27:37,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:27:37,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:27:37,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:27:37,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:27:37,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:27:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:27:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:27:37,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:27:37,722 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:27:37,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:37 BoogieIcfgContainer [2018-11-10 05:27:37,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:27:37,723 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:27:37,723 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:27:37,726 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:27:37,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:27:37,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:27:37" (1/3) ... [2018-11-10 05:27:37,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae28592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:27:37, skipping insertion in model container [2018-11-10 05:27:37,728 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:27:37,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:37" (2/3) ... [2018-11-10 05:27:37,729 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae28592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:27:37, skipping insertion in model container [2018-11-10 05:27:37,729 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:27:37,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:37" (3/3) ... [2018-11-10 05:27:37,730 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:27:37,772 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:27:37,773 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:27:37,773 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:27:37,773 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:27:37,773 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:27:37,773 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:27:37,773 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:27:37,773 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:27:37,773 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:27:37,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 05:27:37,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:27:37,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:37,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:37,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:27:37,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:27:37,802 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:27:37,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 05:27:37,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:27:37,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:37,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:37,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:27:37,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:27:37,809 INFO L793 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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#L555true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15#L555-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 23#L543-4true [2018-11-10 05:27:37,810 INFO L795 eck$LassoCheckResult]: Loop: 23#L543-4true assume true; 16#L543-1true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 20#L544-4true assume !true; 21#L543-3true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 23#L543-4true [2018-11-10 05:27:37,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 05:27:37,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:37,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1329512, now seen corresponding path program 1 times [2018-11-10 05:27:37,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:37,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:37,913 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-10 05:27:37,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:37,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:27:37,917 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:27:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:27:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:27:37,927 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 05:27:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:37,932 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-10 05:27:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:27:37,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-10 05:27:37,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:27:37,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2018-11-10 05:27:37,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 05:27:37,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 05:27:37,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 05:27:37,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:27:37,939 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 05:27:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 05:27:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 05:27:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 05:27:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 05:27:37,963 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 05:27:37,963 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 05:27:37,963 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:27:37,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 05:27:37,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:27:37,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:37,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:37,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:27:37,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:27:37,965 INFO L793 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 63#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 64#L555-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 69#L543-4 [2018-11-10 05:27:37,965 INFO L795 eck$LassoCheckResult]: Loop: 69#L543-4 assume true; 70#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 71#L544-4 assume true; 66#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 67#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 69#L543-4 [2018-11-10 05:27:37,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 05:27:37,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:37,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:37,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash 41193125, now seen corresponding path program 1 times [2018-11-10 05:27:37,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:37,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924673, now seen corresponding path program 1 times [2018-11-10 05:27:37,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,049 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:27:38,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:27:38,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:27:38,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:27:38,050 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:27:38,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:38,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:27:38,051 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:27:38,051 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-10 05:27:38,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:27:38,051 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:27:38,068 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-10 05:27:38,071 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-10 05:27:38,149 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:27:38,149 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:38,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:27:38,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:27:38,172 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:27:38,172 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:38,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:27:38,189 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:38,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:27:38,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:27:38,244 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:27:38,245 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:27:38,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:27:38,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:27:38,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:27:38,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:27:38,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:38,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:27:38,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:27:38,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-10 05:27:38,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:27:38,246 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:27:38,246 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-10 05:27:38,252 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-10 05:27:38,311 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:27:38,314 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:27:38,315 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-10 05:27:38,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:38,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:38,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:38,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:38,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:38,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:38,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:38,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:38,323 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-10 05:27:38,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:38,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:38,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:38,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:38,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:38,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:38,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:38,327 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:27:38,331 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:27:38,332 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:27:38,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:27:38,333 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:27:38,333 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:27:38,333 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2018-11-10 05:27:38,334 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:27:38,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:38,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:38,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:38,384 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-10 05:27:38,386 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-10 05:27:38,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 05:27:38,414 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 34 states and 40 transitions. Complement of second has 6 states. [2018-11-10 05:27:38,415 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-10 05:27:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:27:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 05:27:38,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-10 05:27:38,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:38,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-10 05:27:38,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:38,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-10 05:27:38,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:38,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-10 05:27:38,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:38,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2018-11-10 05:27:38,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 05:27:38,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 05:27:38,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-10 05:27:38,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:27:38,422 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-10 05:27:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-10 05:27:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 05:27:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 05:27:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-10 05:27:38,425 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-10 05:27:38,425 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-10 05:27:38,426 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:27:38,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-10 05:27:38,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:38,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:38,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:38,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:27:38,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:27:38,428 INFO L793 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 175#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 176#L555-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 183#L543-4 assume true; 184#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 185#L544-4 [2018-11-10 05:27:38,429 INFO L795 eck$LassoCheckResult]: Loop: 185#L544-4 assume true; 179#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 171#L545 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L545 172#L545-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L545-1 177#L545-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 158#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 185#L544-4 [2018-11-10 05:27:38,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:38,429 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 05:27:38,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:38,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:38,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:38,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 1 times [2018-11-10 05:27:38,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:38,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:38,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:38,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash 577380690, now seen corresponding path program 1 times [2018-11-10 05:27:38,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:38,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:38,673 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-11-10 05:27:38,727 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:27:38,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:27:38,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:27:38,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:27:38,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:27:38,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:38,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:27:38,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:27:38,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 05:27:38,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:27:38,728 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:27:38,731 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-10 05:27:38,733 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-10 05:27:38,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-10 05:27:38,737 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-10 05:27:38,904 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-10 05:27:38,905 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-10 05:27:38,907 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-10 05:27:38,909 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-10 05:27:38,911 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-10 05:27:38,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:27:38,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:27:38,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:27:39,130 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:27:39,130 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:27:39,131 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-10 05:27:39,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:39,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:39,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:39,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:39,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:39,133 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-10 05:27:39,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:39,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:39,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:39,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:39,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:39,135 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-10 05:27:39,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:39,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:39,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:39,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:39,139 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-10 05:27:39,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:39,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:39,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:39,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:39,152 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-10 05:27:39,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,152 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:27:39,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,155 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:27:39,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:39,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:39,167 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-10 05:27:39,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:39,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:39,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:39,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:39,174 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-10 05:27:39,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:39,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:39,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:39,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:39,179 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-10 05:27:39,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:39,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:39,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:39,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:39,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:39,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:39,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:27:39,240 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:27:39,241 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:27:39,241 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:27:39,242 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 05:27:39,243 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:27:39,243 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 3*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [1*ULTIMATE.start_bubbleSort_~j~0 - 1 >= 0] [2018-11-10 05:27:39,277 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 05:27:39,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:39,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:39,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:39,324 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-10 05:27:39,324 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-10 05:27:39,324 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:27:39,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 90 states and 103 transitions. Complement of second has 7 states. [2018-11-10 05:27:39,359 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-10 05:27:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:27:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 05:27:39,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-10 05:27:39,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:39,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 05:27:39,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:39,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-10 05:27:39,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:39,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 103 transitions. [2018-11-10 05:27:39,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:39,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 51 states and 59 transitions. [2018-11-10 05:27:39,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 05:27:39,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 05:27:39,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 59 transitions. [2018-11-10 05:27:39,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:27:39,363 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-10 05:27:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 59 transitions. [2018-11-10 05:27:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-10 05:27:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 05:27:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-10 05:27:39,366 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-10 05:27:39,366 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-10 05:27:39,366 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:27:39,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 54 transitions. [2018-11-10 05:27:39,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:39,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:39,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:39,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:39,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:27:39,368 INFO L793 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 390#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 383#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 384#L555-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 391#L543-4 assume true; 394#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 395#L544-4 assume true; 388#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 389#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 399#L543-4 assume true; 392#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 393#L544-4 [2018-11-10 05:27:39,368 INFO L795 eck$LassoCheckResult]: Loop: 393#L544-4 assume true; 387#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 379#L545 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L545 380#L545-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L545-1 385#L545-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 366#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 393#L544-4 [2018-11-10 05:27:39,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1958245030, now seen corresponding path program 2 times [2018-11-10 05:27:39,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:39,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:27:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:27:39,411 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:27:39,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 2 times [2018-11-10 05:27:39,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:27:39,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:27:39,479 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-10 05:27:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:39,513 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-10 05:27:39,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:27:39,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 99 transitions. [2018-11-10 05:27:39,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:39,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 83 states and 93 transitions. [2018-11-10 05:27:39,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 05:27:39,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 05:27:39,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 93 transitions. [2018-11-10 05:27:39,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:27:39,516 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-11-10 05:27:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 93 transitions. [2018-11-10 05:27:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2018-11-10 05:27:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 05:27:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-10 05:27:39,519 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 05:27:39,519 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 05:27:39,519 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:27:39,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 57 transitions. [2018-11-10 05:27:39,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:39,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:39,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:39,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:39,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:27:39,522 INFO L793 eck$LassoCheckResult]: Stem: 547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 541#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 532#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 533#L555-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 542#L543-4 assume true; 545#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 546#L544-4 assume true; 538#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 539#L545 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L545 535#L545-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L545-1 536#L545-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 516#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 548#L544-4 assume true; 552#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 549#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 550#L543-4 assume true; 543#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 544#L544-4 [2018-11-10 05:27:39,522 INFO L795 eck$LassoCheckResult]: Loop: 544#L544-4 assume true; 537#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 528#L545 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L545 529#L545-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L545-1 534#L545-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 514#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 544#L544-4 [2018-11-10 05:27:39,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1393429858, now seen corresponding path program 1 times [2018-11-10 05:27:39,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 3 times [2018-11-10 05:27:39,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash -446609242, now seen corresponding path program 2 times [2018-11-10 05:27:39,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:27:39,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:27:39,613 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a13de5bf-9504-4f0c-8df4-eff548d0e3e2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:27:39,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:27:39,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:27:39,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:27:39,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:27:39,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:27:39,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-10 05:27:39,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:27:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:27:39,733 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. cyclomatic complexity: 10 Second operand 13 states. [2018-11-10 05:27:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:39,807 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-11-10 05:27:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:27:39,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 142 transitions. [2018-11-10 05:27:39,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:39,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 119 states and 132 transitions. [2018-11-10 05:27:39,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 05:27:39,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 05:27:39,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 132 transitions. [2018-11-10 05:27:39,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:27:39,810 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-11-10 05:27:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 132 transitions. [2018-11-10 05:27:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2018-11-10 05:27:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 05:27:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-10 05:27:39,815 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 05:27:39,815 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 05:27:39,815 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:27:39,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2018-11-10 05:27:39,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 05:27:39,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:27:39,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:27:39,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:39,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:27:39,817 INFO L793 eck$LassoCheckResult]: Stem: 815#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 809#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 802#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 803#L555-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 810#L543-4 assume true; 813#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 814#L544-4 assume true; 838#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 835#L545 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L545 831#L545-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L545-1 832#L545-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 849#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 818#L544-4 assume true; 819#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 800#L545 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L545 801#L545-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L545-1 805#L545-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 785#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 826#L544-4 assume true; 823#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 820#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 821#L543-4 assume true; 811#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 812#L544-4 [2018-11-10 05:27:39,817 INFO L795 eck$LassoCheckResult]: Loop: 812#L544-4 assume true; 806#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 798#L545 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L545 799#L545-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L545-1 804#L545-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 783#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 812#L544-4 [2018-11-10 05:27:39,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1931896682, now seen corresponding path program 3 times [2018-11-10 05:27:39,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 4 times [2018-11-10 05:27:39,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1623026530, now seen corresponding path program 4 times [2018-11-10 05:27:39,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:27:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:27:40,142 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2018-11-10 05:27:40,202 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:27:40,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:27:40,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:27:40,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:27:40,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:27:40,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:27:40,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:27:40,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:27:40,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 05:27:40,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:27:40,202 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:27:40,205 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-10 05:27:40,208 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-10 05:27:40,209 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-10 05:27:40,211 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-10 05:27:40,212 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-10 05:27:40,214 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-10 05:27:40,215 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-10 05:27:40,216 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-10 05:27:40,375 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-10 05:27:40,377 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-10 05:27:40,379 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-10 05:27:40,383 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-10 05:27:40,385 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-10 05:27:40,566 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:27:40,566 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:27:40,566 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-10 05:27:40,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:40,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:40,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:40,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,568 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-10 05:27:40,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:40,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:40,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:40,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,570 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-10 05:27:40,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:40,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:40,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:40,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,571 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-10 05:27:40,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:40,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:40,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,573 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-10 05:27:40,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:40,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:40,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:40,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,575 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-10 05:27:40,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:40,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:40,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:40,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,576 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-10 05:27:40,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:27:40,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:27:40,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:27:40,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,577 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-10 05:27:40,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:40,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:40,579 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,580 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-10 05:27:40,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:40,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:40,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:27:40,584 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-10 05:27:40,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:27:40,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:27:40,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:27:40,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:27:40,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:27:40,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:27:40,598 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:27:40,610 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:27:40,610 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:27:40,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:27:40,612 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:27:40,612 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:27:40,612 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2) = 16*ULTIMATE.start_bubbleSort_~i~0 - 16*ULTIMATE.start_bubbleSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2 Supporting invariants [] [2018-11-10 05:27:40,635 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 05:27:40,637 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:27:40,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:40,706 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-10 05:27:40,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 05:27:40,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 05:27:40,751 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 105 states and 118 transitions. Complement of second has 11 states. [2018-11-10 05:27:40,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:27:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:27:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-10 05:27:40,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 05:27:40,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:40,752 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:27:40,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:40,808 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-10 05:27:40,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 05:27:40,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 05:27:40,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 105 states and 118 transitions. Complement of second has 11 states. [2018-11-10 05:27:40,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:27:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:27:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-10 05:27:40,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 05:27:40,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:40,839 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:27:40,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:40,890 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-10 05:27:40,890 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 4 loop predicates [2018-11-10 05:27:40,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 05:27:40,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 136 states and 154 transitions. Complement of second has 10 states. [2018-11-10 05:27:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 05:27:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:27:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-10 05:27:40,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 05:27:40,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:40,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 05:27:40,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:40,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-10 05:27:40,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:27:40,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 154 transitions. [2018-11-10 05:27:40,928 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:27:40,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 0 states and 0 transitions. [2018-11-10 05:27:40,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:27:40,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:27:40,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:27:40,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:27:40,929 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:27:40,929 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:27:40,929 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:27:40,929 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:27:40,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:27:40,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:27:40,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:27:40,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:27:40 BoogieIcfgContainer [2018-11-10 05:27:40,934 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:27:40,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:27:40,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:27:40,934 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:27:40,935 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:37" (3/4) ... [2018-11-10 05:27:40,937 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:27:40,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:27:40,938 INFO L168 Benchmark]: Toolchain (without parser) took 3795.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 956.4 MB in the beginning and 850.5 MB in the end (delta: 106.0 MB). Peak memory consumption was 330.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:40,938 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:27:40,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.19 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:40,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -215.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:40,939 INFO L168 Benchmark]: Boogie Preprocessor took 18.73 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-10 05:27:40,939 INFO L168 Benchmark]: RCFGBuilder took 219.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:40,940 INFO L168 Benchmark]: BuchiAutomizer took 3210.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 850.5 MB in the end (delta: 267.5 MB). Peak memory consumption was 340.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:40,940 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.3 GB. Free memory is still 850.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:27:40,942 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.19 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -215.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.73 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 219.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3210.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 850.5 MB in the end (delta: 267.5 MB). Peak memory consumption was 340.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.3 GB. Free memory is still 850.5 MB. 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function 3 * i + -2 * j and consists of 4 locations. One nondeterministic module has affine ranking function 16 * i + -16 * j + unknown-#length-unknown[numbers] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 74 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 138 SDtfs, 287 SDslu, 122 SDs, 0 SdLazy, 211 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf96 lsp96 ukn97 mio100 lsp76 div100 bol100 ite100 ukn100 eq169 hnf90 smp89 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 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...