./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/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 4fc86a08ff37d05adddb13279399a852f6ece83c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:54:59,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:54:59,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:54:59,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:54:59,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:54:59,633 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:54:59,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:54:59,635 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:54:59,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:54:59,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:54:59,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:54:59,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:54:59,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:54:59,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:54:59,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:54:59,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:54:59,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:54:59,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:54:59,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:54:59,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:54:59,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:54:59,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:54:59,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:54:59,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:54:59,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:54:59,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:54:59,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:54:59,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:54:59,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:54:59,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:54:59,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:54:59,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:54:59,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:54:59,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:54:59,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:54:59,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:54:59,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:54:59,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:54:59,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:54:59,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:54:59,665 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:54:59,666 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:54:59,666 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:54:59,666 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:54:59,666 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:54:59,666 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:54:59,666 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:54:59,667 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:54:59,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:54:59,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:54:59,667 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:54:59,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:54:59,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:54:59,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:54:59,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:54:59,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:54:59,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:54:59,668 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:54:59,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:54:59,668 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:54:59,668 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:54:59,669 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:54:59,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:54:59,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:54:59,669 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:54:59,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:54:59,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:54:59,670 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:54:59,670 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:54:59,670 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_fa861317-ff27-4ce7-bac1-9517c0e9cea5/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 -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2018-11-18 16:54:59,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:54:59,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:54:59,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:54:59,701 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:54:59,701 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:54:59,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-18 16:54:59,735 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/data/5b83192d8/1b13e4e5d1df4493bfca7f592f4d3163/FLAG9a82acb1a [2018-11-18 16:55:00,122 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:55:00,123 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-18 16:55:00,126 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/data/5b83192d8/1b13e4e5d1df4493bfca7f592f4d3163/FLAG9a82acb1a [2018-11-18 16:55:00,135 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/data/5b83192d8/1b13e4e5d1df4493bfca7f592f4d3163 [2018-11-18 16:55:00,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:55:00,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:55:00,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:00,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:55:00,140 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:55:00,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f35898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00, skipping insertion in model container [2018-11-18 16:55:00,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:55:00,161 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:55:00,269 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:00,271 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:55:00,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:00,293 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:55:00,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00 WrapperNode [2018-11-18 16:55:00,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:00,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:55:00,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:55:00,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:55:00,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:55:00,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:55:00,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:55:00,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:55:00,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... [2018-11-18 16:55:00,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:55:00,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:55:00,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:55:00,338 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:55:00,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/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-18 16:55:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:55:00,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:55:00,607 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:55:00,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:00 BoogieIcfgContainer [2018-11-18 16:55:00,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:55:00,607 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:55:00,607 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:55:00,610 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:55:00,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:55:00,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:55:00" (1/3) ... [2018-11-18 16:55:00,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a199154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:55:00, skipping insertion in model container [2018-11-18 16:55:00,612 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:55:00,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:00" (2/3) ... [2018-11-18 16:55:00,613 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a199154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:55:00, skipping insertion in model container [2018-11-18 16:55:00,613 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:55:00,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:00" (3/3) ... [2018-11-18 16:55:00,614 INFO L375 chiAutomizerObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-18 16:55:00,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:55:00,668 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:55:00,668 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:55:00,668 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:55:00,668 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:55:00,668 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:55:00,668 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:55:00,668 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:55:00,669 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:55:00,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-18 16:55:00,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 16:55:00,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:00,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:00,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:00,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:00,709 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:55:00,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2018-11-18 16:55:00,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 16:55:00,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:00,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:00,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:00,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:00,719 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 59#L13true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 34#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 44#L45-1true [2018-11-18 16:55:00,719 INFO L796 eck$LassoCheckResult]: Loop: 44#L45-1true assume true; 7#L21true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 56#L24-3true assume !true; 38#L24-4true assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 35#L4-30true assume !(0 == __VERIFIER_assert_~cond); 48#L4-32true assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 46#L4-33true assume !(0 == __VERIFIER_assert_~cond); 43#L4-35true assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 44#L45-1true [2018-11-18 16:55:00,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-18 16:55:00,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:00,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1436294447, now seen corresponding path program 1 times [2018-11-18 16:55:00,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:00,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:00,838 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-18 16:55:00,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:00,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:55:00,842 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:55:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:55:00,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:55:00,852 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-18 16:55:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:00,858 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-18 16:55:00,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:55:00,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 66 transitions. [2018-11-18 16:55:00,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-18 16:55:00,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 41 states and 47 transitions. [2018-11-18 16:55:00,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-18 16:55:00,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-18 16:55:00,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-18 16:55:00,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:55:00,865 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 16:55:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-18 16:55:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 16:55:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 16:55:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-18 16:55:00,883 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 16:55:00,883 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 16:55:00,883 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:55:00,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2018-11-18 16:55:00,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-18 16:55:00,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:00,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:00,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:00,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:00,885 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 140#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 126#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 127#L45-1 [2018-11-18 16:55:00,885 INFO L796 eck$LassoCheckResult]: Loop: 127#L45-1 assume true; 141#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 134#L24-3 assume true; 162#L24-1 assume !(main_~j~0 <= main_~r~0); 137#L24-4 assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 130#L4-30 assume !(0 == __VERIFIER_assert_~cond); 131#L4-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 149#L4-33 assume !(0 == __VERIFIER_assert_~cond); 146#L4-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 127#L45-1 [2018-11-18 16:55:00,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:00,885 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-18 16:55:00,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:00,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:00,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1050635401, now seen corresponding path program 1 times [2018-11-18 16:55:00,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:00,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:00,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:00,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1141532528, now seen corresponding path program 1 times [2018-11-18 16:55:00,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:00,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:00,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:00,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:00,944 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-18 16:55:00,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:00,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:55:01,089 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:01,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:01,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:01,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:01,090 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:55:01,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:01,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:01,090 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:01,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-18 16:55:01,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:01,091 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:01,107 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-18 16:55:01,124 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-18 16:55:01,126 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-18 16:55:01,175 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:01,176 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/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-18 16:55:01,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:01,182 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/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-18 16:55:01,201 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:55:01,202 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:01,421 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:55:01,422 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:01,422 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:01,422 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:01,423 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:01,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:01,423 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:01,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:01,423 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:01,423 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-18 16:55:01,423 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:01,423 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:01,424 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-18 16:55:01,427 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-18 16:55:01,435 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-18 16:55:01,482 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:01,485 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:01,486 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-18 16:55:01,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:01,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:01,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:01,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:01,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:01,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:01,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:01,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:01,492 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-18 16:55:01,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:01,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:01,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:01,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:01,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:01,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:01,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:01,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:01,497 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-18 16:55:01,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:01,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:01,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:01,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:01,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:01,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:01,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:01,505 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:01,513 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:55:01,513 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:01,515 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:01,515 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:55:01,515 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:01,515 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-11-18 16:55:01,516 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:55:01,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:01,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:01,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:01,575 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-18 16:55:01,578 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-18 16:55:01,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 16:55:01,633 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 6 states. [2018-11-18 16:55:01,633 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-18 16:55:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:55:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2018-11-18 16:55:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-18 16:55:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:01,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-18 16:55:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:01,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-18 16:55:01,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:01,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 135 transitions. [2018-11-18 16:55:01,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2018-11-18 16:55:01,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 114 states and 131 transitions. [2018-11-18 16:55:01,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-18 16:55:01,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-18 16:55:01,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 131 transitions. [2018-11-18 16:55:01,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:01,642 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-11-18 16:55:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 131 transitions. [2018-11-18 16:55:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-18 16:55:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-18 16:55:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-11-18 16:55:01,647 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-11-18 16:55:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:55:01,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:55:01,648 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 3 states. [2018-11-18 16:55:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:01,669 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2018-11-18 16:55:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:55:01,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 156 transitions. [2018-11-18 16:55:01,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2018-11-18 16:55:01,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 104 states and 118 transitions. [2018-11-18 16:55:01,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2018-11-18 16:55:01,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2018-11-18 16:55:01,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 118 transitions. [2018-11-18 16:55:01,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:55:01,673 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-11-18 16:55:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 118 transitions. [2018-11-18 16:55:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2018-11-18 16:55:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 16:55:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-18 16:55:01,676 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-18 16:55:01,676 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-18 16:55:01,676 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:55:01,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 80 transitions. [2018-11-18 16:55:01,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2018-11-18 16:55:01,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:01,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:01,678 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:01,678 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:01,678 INFO L794 eck$LassoCheckResult]: Stem: 636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 613#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 598#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 599#L45-1 [2018-11-18 16:55:01,678 INFO L796 eck$LassoCheckResult]: Loop: 599#L45-1 assume true; 648#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 646#L24-3 assume true; 643#L24-1 assume !(main_~j~0 <= main_~r~0); 640#L24-4 assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 603#L4-30 assume !(0 == __VERIFIER_assert_~cond); 604#L4-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 622#L4-33 assume !(0 == __VERIFIER_assert_~cond); 619#L4-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 599#L45-1 [2018-11-18 16:55:01,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2018-11-18 16:55:01,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:01,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:01,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:01,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:01,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1050635401, now seen corresponding path program 2 times [2018-11-18 16:55:01,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:01,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:01,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:01,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1534559538, now seen corresponding path program 1 times [2018-11-18 16:55:01,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:01,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:01,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:01,726 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-18 16:55:01,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:01,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:55:01,832 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:01,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:01,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:01,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:01,833 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:55:01,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:01,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:01,833 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:01,833 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-18 16:55:01,833 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:01,833 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:01,834 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-18 16:55:01,836 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-18 16:55:01,845 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-18 16:55:01,894 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:01,895 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/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-18 16:55:01,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:01,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:01,899 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:55:01,900 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:01,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:01,920 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:01,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:55:01,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:02,154 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:55:02,155 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:02,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:02,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:02,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:02,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:02,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:02,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:02,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:02,156 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-18 16:55:02,156 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:02,156 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:02,157 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-18 16:55:02,160 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-18 16:55:02,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:55:02,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:02,202 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:02,203 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-18 16:55:02,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:02,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:02,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:02,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:02,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:02,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:02,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:02,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:02,208 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-18 16:55:02,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:02,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:02,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:02,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:02,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:02,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:02,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:02,213 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:02,216 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:55:02,216 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:02,217 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:02,217 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:55:02,217 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:02,217 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-11-18 16:55:02,217 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:55:02,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:02,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:02,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:02,264 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-18 16:55:02,264 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-18 16:55:02,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 80 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 16:55:02,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 80 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 169 states and 193 transitions. Complement of second has 6 states. [2018-11-18 16:55:02,286 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-18 16:55:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:55:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2018-11-18 16:55:02,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-18 16:55:02,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:02,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-18 16:55:02,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:02,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-18 16:55:02,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:02,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 193 transitions. [2018-11-18 16:55:02,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2018-11-18 16:55:02,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 132 states and 151 transitions. [2018-11-18 16:55:02,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2018-11-18 16:55:02,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-11-18 16:55:02,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 151 transitions. [2018-11-18 16:55:02,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:02,293 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 151 transitions. [2018-11-18 16:55:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 151 transitions. [2018-11-18 16:55:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 71. [2018-11-18 16:55:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 16:55:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2018-11-18 16:55:02,299 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 82 transitions. [2018-11-18 16:55:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:55:02,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:55:02,299 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 5 states. [2018-11-18 16:55:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:02,414 INFO L93 Difference]: Finished difference Result 219 states and 243 transitions. [2018-11-18 16:55:02,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:55:02,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 243 transitions. [2018-11-18 16:55:02,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2018-11-18 16:55:02,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 243 transitions. [2018-11-18 16:55:02,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2018-11-18 16:55:02,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-18 16:55:02,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 243 transitions. [2018-11-18 16:55:02,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:02,418 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 243 transitions. [2018-11-18 16:55:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 243 transitions. [2018-11-18 16:55:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 76. [2018-11-18 16:55:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 16:55:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-18 16:55:02,424 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-18 16:55:02,424 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-18 16:55:02,424 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:55:02,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 87 transitions. [2018-11-18 16:55:02,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-18 16:55:02,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:02,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:02,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:02,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:02,425 INFO L794 eck$LassoCheckResult]: Stem: 1262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1219#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1196#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1198#L45-1 [2018-11-18 16:55:02,426 INFO L796 eck$LassoCheckResult]: Loop: 1198#L45-1 assume true; 1224#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1208#L24-3 assume true; 1260#L24-1 assume !(main_~j~0 <= main_~r~0); 1215#L24-4 assume !(main_~l~0 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1216#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1253#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1250#L4-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1198#L45-1 [2018-11-18 16:55:02,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2018-11-18 16:55:02,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:02,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:02,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1029640691, now seen corresponding path program 1 times [2018-11-18 16:55:02,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:02,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:02,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:02,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:02,453 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-18 16:55:02,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:02,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:55:02,454 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:55:02,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:55:02,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:55:02,454 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 16:55:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:02,510 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2018-11-18 16:55:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:55:02,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 154 transitions. [2018-11-18 16:55:02,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-18 16:55:02,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 136 states and 153 transitions. [2018-11-18 16:55:02,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 16:55:02,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-18 16:55:02,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 153 transitions. [2018-11-18 16:55:02,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:02,513 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 153 transitions. [2018-11-18 16:55:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 153 transitions. [2018-11-18 16:55:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2018-11-18 16:55:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 16:55:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-11-18 16:55:02,517 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-18 16:55:02,517 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-18 16:55:02,517 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:55:02,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 86 transitions. [2018-11-18 16:55:02,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-18 16:55:02,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:02,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:02,518 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:55:02,518 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:02,518 INFO L794 eck$LassoCheckResult]: Stem: 1484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1441#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1418#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1420#L45-1 [2018-11-18 16:55:02,518 INFO L796 eck$LassoCheckResult]: Loop: 1420#L45-1 assume true; 1442#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1443#L24-3 assume true; 1482#L24-1 assume !!(main_~j~0 <= main_~r~0); 1460#L25 assume !(main_~j~0 < main_~r~0); 1455#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1456#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1451#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1446#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1447#L4-17 assume { :end_inline___VERIFIER_assert } true; 1476#L35 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1437#L24-4 assume !(main_~l~0 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1438#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1450#L4-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1475#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1472#L4-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1420#L45-1 [2018-11-18 16:55:02,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2018-11-18 16:55:02,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:02,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:02,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2054214721, now seen corresponding path program 1 times [2018-11-18 16:55:02,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:02,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:02,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash -106412504, now seen corresponding path program 1 times [2018-11-18 16:55:02,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:02,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:02,575 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-18 16:55:02,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:02,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:55:02,730 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:02,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:02,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:02,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:02,731 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:55:02,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:02,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:02,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:02,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-18 16:55:02,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:02,731 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:02,732 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-18 16:55:02,743 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-18 16:55:02,745 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-18 16:55:02,748 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-18 16:55:02,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:02,822 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:02,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:02,836 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:02,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:55:02,857 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:02,877 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:55:02,878 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:02,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:02,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:02,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:02,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:02,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:02,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:02,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:02,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-18 16:55:02,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:02,879 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:02,880 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-18 16:55:02,888 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-18 16:55:02,890 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-18 16:55:02,891 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-18 16:55:02,931 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:02,931 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:02,931 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-18 16:55:02,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:02,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:02,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:02,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:02,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:02,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:02,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:02,936 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:02,939 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:55:02,939 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:02,940 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:02,940 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:55:02,940 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:02,940 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-11-18 16:55:02,940 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:55:02,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:02,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:02,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:02,969 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-18 16:55:02,969 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-18 16:55:02,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 86 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 16:55:02,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 86 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 145 states and 165 transitions. Complement of second has 6 states. [2018-11-18 16:55:02,992 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-18 16:55:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:55:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-18 16:55:02,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-18 16:55:02,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:02,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 20 letters. Loop has 16 letters. [2018-11-18 16:55:02,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:02,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 4 letters. Loop has 32 letters. [2018-11-18 16:55:02,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:02,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 165 transitions. [2018-11-18 16:55:02,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-18 16:55:02,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 140 states and 159 transitions. [2018-11-18 16:55:02,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-18 16:55:02,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-18 16:55:02,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2018-11-18 16:55:02,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:02,995 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-11-18 16:55:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2018-11-18 16:55:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-18 16:55:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 16:55:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2018-11-18 16:55:02,998 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 157 transitions. [2018-11-18 16:55:02,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:55:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:55:02,999 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand 5 states. [2018-11-18 16:55:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:03,030 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-18 16:55:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:55:03,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 92 transitions. [2018-11-18 16:55:03,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-18 16:55:03,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 75 states and 85 transitions. [2018-11-18 16:55:03,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 16:55:03,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 16:55:03,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 85 transitions. [2018-11-18 16:55:03,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:03,032 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-18 16:55:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 85 transitions. [2018-11-18 16:55:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-18 16:55:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 16:55:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-18 16:55:03,034 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-18 16:55:03,034 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-18 16:55:03,034 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:55:03,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 85 transitions. [2018-11-18 16:55:03,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-18 16:55:03,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:03,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:03,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:55:03,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:03,036 INFO L794 eck$LassoCheckResult]: Stem: 2012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1967#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1968#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1946#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1947#L45-1 assume true; 1969#L21 [2018-11-18 16:55:03,036 INFO L796 eck$LassoCheckResult]: Loop: 1969#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1970#L24-3 assume true; 2010#L24-1 assume !!(main_~j~0 <= main_~r~0); 1988#L25 assume !(main_~j~0 < main_~r~0); 1983#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1984#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1978#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1973#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1974#L4-17 assume { :end_inline___VERIFIER_assert } true; 2004#L35 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1964#L24-4 assume !(main_~l~0 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1965#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1977#L4-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2003#L4-39 assume !(0 == __VERIFIER_assert_~cond); 2000#L4-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1982#L45-1 assume true; 1969#L21 [2018-11-18 16:55:03,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash 28695786, now seen corresponding path program 1 times [2018-11-18 16:55:03,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:03,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1428410305, now seen corresponding path program 2 times [2018-11-18 16:55:03,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1304642902, now seen corresponding path program 1 times [2018-11-18 16:55:03,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:03,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:03,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:03,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,182 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:03,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:03,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:03,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:03,182 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:55:03,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:03,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:03,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-18 16:55:03,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:03,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:03,184 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-18 16:55:03,185 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-18 16:55:03,188 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-18 16:55:03,197 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-18 16:55:03,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:03,246 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:03,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:03,262 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:55:03,263 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=7} Honda state: {ULTIMATE.start_main_#t~nondet5=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:03,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:03,284 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:55:03,284 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:03,300 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:55:03,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:03,339 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:55:03,340 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:03,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:03,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:03,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:03,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:03,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:03,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:03,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-18 16:55:03,341 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:03,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:03,342 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-18 16:55:03,353 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-18 16:55:03,354 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-18 16:55:03,360 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-18 16:55:03,416 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:03,416 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:03,416 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-18 16:55:03,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:03,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:03,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:03,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:03,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:03,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:03,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:03,419 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:03,421 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:55:03,421 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:03,422 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:03,422 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:55:03,422 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:03,422 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-11-18 16:55:03,422 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:55:03,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:03,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:03,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:03,465 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-18 16:55:03,465 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 16:55:03,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 16:55:03,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 149 states and 170 transitions. Complement of second has 6 states. [2018-11-18 16:55:03,478 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-18 16:55:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:55:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-18 16:55:03,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-18 16:55:03,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:03,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 21 letters. Loop has 16 letters. [2018-11-18 16:55:03,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:03,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 5 letters. Loop has 32 letters. [2018-11-18 16:55:03,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:03,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 170 transitions. [2018-11-18 16:55:03,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 16:55:03,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 144 states and 164 transitions. [2018-11-18 16:55:03,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 16:55:03,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 16:55:03,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 164 transitions. [2018-11-18 16:55:03,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:03,482 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-11-18 16:55:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 164 transitions. [2018-11-18 16:55:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-11-18 16:55:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 16:55:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2018-11-18 16:55:03,486 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 160 transitions. [2018-11-18 16:55:03,486 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 160 transitions. [2018-11-18 16:55:03,486 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:55:03,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 160 transitions. [2018-11-18 16:55:03,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 16:55:03,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:03,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:03,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:55:03,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:03,487 INFO L794 eck$LassoCheckResult]: Stem: 2329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2279#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2257#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2258#L45-1 assume true; 2294#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2268#L24-3 [2018-11-18 16:55:03,487 INFO L796 eck$LassoCheckResult]: Loop: 2268#L24-3 assume true; 2327#L24-1 assume !!(main_~j~0 <= main_~r~0); 2303#L25 assume !(main_~j~0 < main_~r~0); 2298#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2299#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2289#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2283#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2284#L4-17 assume { :end_inline___VERIFIER_assert } true; 2321#L35 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2318#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2314#L4-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2310#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2311#L4-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2332#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2325#L4-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2273#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2267#L4-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2268#L24-3 [2018-11-18 16:55:03,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash 889569388, now seen corresponding path program 1 times [2018-11-18 16:55:03,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:03,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:03,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:03,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 997435947, now seen corresponding path program 1 times [2018-11-18 16:55:03,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1549832928, now seen corresponding path program 1 times [2018-11-18 16:55:03,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:03,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:03,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:03,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 16:55:03,649 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:03,649 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:03,649 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:03,649 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:03,649 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:55:03,649 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,649 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:03,649 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:03,649 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-18 16:55:03,649 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:03,649 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:03,650 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-18 16:55:03,653 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-18 16:55:03,654 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-18 16:55:03,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:03,693 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:03,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:03,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:55:03,697 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:03,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:03,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:55:03,715 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:03,731 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:55:03,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:03,816 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:55:03,817 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:03,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:03,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:03,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:03,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:03,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:03,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:03,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:03,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration7_Loop [2018-11-18 16:55:03,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:03,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:03,819 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-18 16:55:03,822 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-18 16:55:03,823 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-18 16:55:03,858 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:03,858 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:03,859 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-18 16:55:03,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:03,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:03,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:03,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:03,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:03,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:03,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:03,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:03,862 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-18 16:55:03,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:03,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:03,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:03,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:03,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:03,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:03,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:03,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:03,864 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-18 16:55:03,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:03,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:03,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:03,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:03,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:03,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:03,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:03,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:03,869 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:55:03,869 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:03,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:03,870 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:55:03,870 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:03,870 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~r~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-18 16:55:03,870 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:55:03,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:03,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:03,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:03,919 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-18 16:55:03,920 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-18 16:55:03,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 160 transitions. cyclomatic complexity: 24 Second operand 6 states. [2018-11-18 16:55:04,036 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 160 transitions. cyclomatic complexity: 24. Second operand 6 states. Result 567 states and 624 transitions. Complement of second has 13 states. [2018-11-18 16:55:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 16:55:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-18 16:55:04,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 6 letters. Loop has 17 letters. [2018-11-18 16:55:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 23 letters. Loop has 17 letters. [2018-11-18 16:55:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:04,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 6 letters. Loop has 34 letters. [2018-11-18 16:55:04,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:04,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 624 transitions. [2018-11-18 16:55:04,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 16:55:04,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 401 states and 448 transitions. [2018-11-18 16:55:04,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-18 16:55:04,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-18 16:55:04,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 448 transitions. [2018-11-18 16:55:04,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:04,047 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 448 transitions. [2018-11-18 16:55:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 448 transitions. [2018-11-18 16:55:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 285. [2018-11-18 16:55:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-18 16:55:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 323 transitions. [2018-11-18 16:55:04,053 INFO L728 BuchiCegarLoop]: Abstraction has 285 states and 323 transitions. [2018-11-18 16:55:04,053 INFO L608 BuchiCegarLoop]: Abstraction has 285 states and 323 transitions. [2018-11-18 16:55:04,053 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 16:55:04,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 323 transitions. [2018-11-18 16:55:04,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 16:55:04,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:04,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:04,055 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:04,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:04,055 INFO L794 eck$LassoCheckResult]: Stem: 3142#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3089#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 3090#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 3069#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 3070#L45-1 assume true; 3105#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 3139#L24-3 assume true; 3140#L24-1 assume !!(main_~j~0 <= main_~r~0); 3167#L25 assume main_~j~0 < main_~r~0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3166#L4 assume !(0 == __VERIFIER_assert_~cond); 3165#L4-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3164#L4-3 assume !(0 == __VERIFIER_assert_~cond); 3163#L4-5 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3162#L4-6 assume !(0 == __VERIFIER_assert_~cond); 3161#L4-8 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3160#L4-9 assume !(0 == __VERIFIER_assert_~cond); 3159#L4-11 assume { :end_inline___VERIFIER_assert } true; 3156#L30 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 3109#L25-1 [2018-11-18 16:55:04,056 INFO L796 eck$LassoCheckResult]: Loop: 3109#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3110#L4-12 assume !(0 == __VERIFIER_assert_~cond); 3101#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3095#L4-15 assume !(0 == __VERIFIER_assert_~cond); 3096#L4-17 assume { :end_inline___VERIFIER_assert } true; 3133#L35 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3130#L4-18 assume !(0 == __VERIFIER_assert_~cond); 3126#L4-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3122#L4-21 assume !(0 == __VERIFIER_assert_~cond); 3123#L4-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3145#L4-24 assume !(0 == __VERIFIER_assert_~cond); 3137#L4-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3085#L4-27 assume !(0 == __VERIFIER_assert_~cond); 3079#L4-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 3080#L24-3 assume true; 3147#L24-1 assume !!(main_~j~0 <= main_~r~0); 3115#L25 assume !(main_~j~0 < main_~r~0); 3109#L25-1 [2018-11-18 16:55:04,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash 978197297, now seen corresponding path program 1 times [2018-11-18 16:55:04,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:04,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:04,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:04,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:04,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:04,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 972596877, now seen corresponding path program 2 times [2018-11-18 16:55:04,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:04,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:04,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:04,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1671319901, now seen corresponding path program 1 times [2018-11-18 16:55:04,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:04,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:04,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:04,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:55:04,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:55:04,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:04,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:55:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-11-18 16:55:04,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 16:55:04,430 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:04,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:04,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:04,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:04,431 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:55:04,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:04,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:04,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:04,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-18 16:55:04,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:04,431 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:04,432 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-18 16:55:04,434 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-18 16:55:04,438 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-18 16:55:04,480 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:04,480 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:04,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:04,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:04,484 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:55:04,484 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:04,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:04,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:04,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:55:04,513 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:04,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:04,529 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:04,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:55:04,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:04,641 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:55:04,642 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:04,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:04,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:04,643 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:04,643 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:04,643 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:04,643 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:04,643 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:04,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-18 16:55:04,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:04,643 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:04,644 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-18 16:55:04,647 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-18 16:55:04,656 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-18 16:55:04,698 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:04,698 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:04,699 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-18 16:55:04,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:04,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:04,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:04,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:04,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:04,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:04,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:04,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:55:04,701 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-18 16:55:04,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:04,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:04,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:04,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:04,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:04,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:04,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:04,711 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:04,715 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:55:04,715 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:04,715 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:04,715 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:55:04,715 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:04,716 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-18 16:55:04,716 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:55:04,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:04,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:04,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:04,805 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-18 16:55:04,805 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 16:55:04,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 285 states and 323 transitions. cyclomatic complexity: 46 Second operand 7 states. [2018-11-18 16:55:04,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 285 states and 323 transitions. cyclomatic complexity: 46. Second operand 7 states. Result 752 states and 838 transitions. Complement of second has 15 states. [2018-11-18 16:55:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:55:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2018-11-18 16:55:04,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 18 letters. Loop has 17 letters. [2018-11-18 16:55:04,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:04,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 35 letters. Loop has 17 letters. [2018-11-18 16:55:04,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:04,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 103 transitions. Stem has 18 letters. Loop has 34 letters. [2018-11-18 16:55:04,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:04,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 752 states and 838 transitions. [2018-11-18 16:55:04,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-18 16:55:04,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 752 states to 593 states and 668 transitions. [2018-11-18 16:55:04,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-18 16:55:04,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-18 16:55:04,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 668 transitions. [2018-11-18 16:55:04,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:04,931 INFO L705 BuchiCegarLoop]: Abstraction has 593 states and 668 transitions. [2018-11-18 16:55:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 668 transitions. [2018-11-18 16:55:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 523. [2018-11-18 16:55:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-11-18 16:55:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 592 transitions. [2018-11-18 16:55:04,938 INFO L728 BuchiCegarLoop]: Abstraction has 523 states and 592 transitions. [2018-11-18 16:55:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:55:04,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:55:04,939 INFO L87 Difference]: Start difference. First operand 523 states and 592 transitions. Second operand 12 states. [2018-11-18 16:55:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:05,111 INFO L93 Difference]: Finished difference Result 968 states and 1068 transitions. [2018-11-18 16:55:05,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:55:05,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 1068 transitions. [2018-11-18 16:55:05,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-18 16:55:05,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 666 states and 742 transitions. [2018-11-18 16:55:05,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-18 16:55:05,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-18 16:55:05,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 666 states and 742 transitions. [2018-11-18 16:55:05,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:55:05,119 INFO L705 BuchiCegarLoop]: Abstraction has 666 states and 742 transitions. [2018-11-18 16:55:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states and 742 transitions. [2018-11-18 16:55:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 564. [2018-11-18 16:55:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-11-18 16:55:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 630 transitions. [2018-11-18 16:55:05,128 INFO L728 BuchiCegarLoop]: Abstraction has 564 states and 630 transitions. [2018-11-18 16:55:05,128 INFO L608 BuchiCegarLoop]: Abstraction has 564 states and 630 transitions. [2018-11-18 16:55:05,128 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 16:55:05,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 564 states and 630 transitions. [2018-11-18 16:55:05,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-18 16:55:05,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:55:05,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:55:05,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:05,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:05,131 INFO L794 eck$LassoCheckResult]: Stem: 5956#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5884#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 5885#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 5862#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5863#L45-1 assume true; 5901#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 6230#L24-3 assume true; 6231#L24-1 assume !!(main_~j~0 <= main_~r~0); 6364#L25 assume !(main_~j~0 < main_~r~0); 5916#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5909#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5910#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5888#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5889#L4-17 assume { :end_inline___VERIFIER_assert } true; 5972#L35 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 5883#L24-4 assume main_~l~0 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5868#L4-30 assume !(0 == __VERIFIER_assert_~cond); 5869#L4-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5911#L4-33 assume !(0 == __VERIFIER_assert_~cond); 5912#L4-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 6377#L45-1 assume true; 5985#L21 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5874#L24-3 [2018-11-18 16:55:05,132 INFO L796 eck$LassoCheckResult]: Loop: 5874#L24-3 assume true; 5982#L24-1 assume !!(main_~j~0 <= main_~r~0); 5981#L25 assume !(main_~j~0 < main_~r~0); 5940#L25-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5907#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5908#L4-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5988#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5935#L4-17 assume { :end_inline___VERIFIER_assert } true; 5936#L35 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5930#L4-18 assume !(0 == __VERIFIER_assert_~cond); 5931#L4-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5920#L4-21 assume !(0 == __VERIFIER_assert_~cond); 5921#L4-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5960#L4-24 assume !(0 == __VERIFIER_assert_~cond); 5961#L4-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5880#L4-27 assume !(0 == __VERIFIER_assert_~cond); 5873#L4-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5874#L24-3 [2018-11-18 16:55:05,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:05,132 INFO L82 PathProgramCache]: Analyzing trace with hash -490304106, now seen corresponding path program 1 times [2018-11-18 16:55:05,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:05,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:05,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:05,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash 997435947, now seen corresponding path program 3 times [2018-11-18 16:55:05,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:05,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:05,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:05,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1071733046, now seen corresponding path program 1 times [2018-11-18 16:55:05,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:05,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:05,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:05,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:55:05,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:05,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:55:05,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:55:05,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:05,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:55:05,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 16:55:05,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 16:55:05,349 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:05,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:05,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:05,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:05,349 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:55:05,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:05,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:05,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:05,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-18 16:55:05,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:05,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:05,350 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-18 16:55:05,360 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-18 16:55:05,367 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-18 16:55:05,398 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:05,398 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:05,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:55:05,401 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa861317-ff27-4ce7-bac1-9517c0e9cea5/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:05,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:55:05,419 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:55:05,490 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:55:05,491 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:55:05,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:55:05,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:55:05,491 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:55:05,491 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:55:05,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:55:05,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:55:05,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:55:05,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-18 16:55:05,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:55:05,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:55:05,492 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-18 16:55:05,500 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-18 16:55:05,503 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-18 16:55:05,539 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:55:05,539 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:55:05,539 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-18 16:55:05,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:55:05,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:55:05,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:55:05,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:55:05,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:55:05,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:55:05,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:55:05,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:55:05,547 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:55:05,547 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:55:05,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:55:05,547 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:55:05,548 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:55:05,548 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-18 16:55:05,548 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:55:05,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:05,609 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-18 16:55:05,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 16:55:05,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77 Second operand 7 states. [2018-11-18 16:55:05,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77. Second operand 7 states. Result 894 states and 976 transitions. Complement of second has 15 states. [2018-11-18 16:55:05,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:55:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-18 16:55:05,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 22 letters. Loop has 17 letters. [2018-11-18 16:55:05,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:05,697 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:55:05,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:05,782 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-18 16:55:05,782 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 16:55:05,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77 Second operand 7 states. [2018-11-18 16:55:05,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77. Second operand 7 states. Result 896 states and 978 transitions. Complement of second has 17 states. [2018-11-18 16:55:05,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:55:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2018-11-18 16:55:05,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 22 letters. Loop has 17 letters. [2018-11-18 16:55:05,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:05,887 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:55:05,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:05,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:05,980 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-18 16:55:05,980 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 5 loop predicates [2018-11-18 16:55:05,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77 Second operand 7 states. [2018-11-18 16:55:06,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 564 states and 630 transitions. cyclomatic complexity: 77. Second operand 7 states. Result 1335 states and 1465 transitions. Complement of second has 14 states. [2018-11-18 16:55:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 16:55:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:55:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-18 16:55:06,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 22 letters. Loop has 17 letters. [2018-11-18 16:55:06,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:06,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 39 letters. Loop has 17 letters. [2018-11-18 16:55:06,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:06,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 104 transitions. Stem has 22 letters. Loop has 34 letters. [2018-11-18 16:55:06,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:55:06,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1335 states and 1465 transitions. [2018-11-18 16:55:06,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:55:06,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1335 states to 0 states and 0 transitions. [2018-11-18 16:55:06,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:55:06,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:55:06,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:55:06,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:55:06,102 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:06,102 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:55:06,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:55:06,102 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 7 states. [2018-11-18 16:55:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:06,102 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 16:55:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:55:06,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 16:55:06,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:55:06,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:55:06,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:55:06,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:55:06,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:55:06,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:55:06,103 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:06,103 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:06,103 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:55:06,103 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 16:55:06,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:55:06,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:55:06,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:55:06,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:55:06 BoogieIcfgContainer [2018-11-18 16:55:06,109 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:55:06,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:55:06,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:55:06,109 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:55:06,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:00" (3/4) ... [2018-11-18 16:55:06,112 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:55:06,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:55:06,113 INFO L168 Benchmark]: Toolchain (without parser) took 5975.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.3 MB). Free memory was 959.1 MB in the beginning and 953.3 MB in the end (delta: 5.9 MB). Peak memory consumption was 347.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:06,114 INFO L168 Benchmark]: CDTParser took 0.11 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-18 16:55:06,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.17 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:06,115 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.10 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:06,115 INFO L168 Benchmark]: Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:06,116 INFO L168 Benchmark]: RCFGBuilder took 269.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:06,116 INFO L168 Benchmark]: BuchiAutomizer took 5501.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 953.3 MB in the end (delta: 179.6 MB). Peak memory consumption was 361.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:06,117 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 1.4 GB. Free memory is still 953.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:55:06,119 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.17 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.10 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5501.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 953.3 MB in the end (delta: 179.6 MB). Peak memory consumption was 361.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.46 ms. Allocated memory is still 1.4 GB. Free memory is still 953.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (7 trivial, 6 deterministic, 1 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function 3 * r + -2 * j and consists of 7 locations. One deterministic module has affine ranking function -2 * j + 3 * n and consists of 8 locations. One nondeterministic module has affine ranking function 3 * n + -2 * j and consists of 8 locations. 7 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 594 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 564 states and ocurred in iteration 8. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 772 SDtfs, 1273 SDslu, 764 SDs, 0 SdLazy, 923 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital36 mio100 ax100 hnf96 lsp76 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp96 dnf100 smp100 tf105 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...