./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-635dfa2 [2018-12-09 12:53:08,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:53:08,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:53:08,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:53:08,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:53:08,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:53:08,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:53:08,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:53:08,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:53:08,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:53:08,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:53:08,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:53:08,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:53:08,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:53:08,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:53:08,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:53:08,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:53:08,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:53:08,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:53:08,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:53:08,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:53:08,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:53:08,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:53:08,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:53:08,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:53:08,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:53:08,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:53:08,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:53:08,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:53:08,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:53:08,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:53:08,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:53:08,596 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:53:08,596 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:53:08,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:53:08,597 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:53:08,597 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 12:53:08,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:53:08,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:53:08,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:53:08,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:53:08,606 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:53:08,606 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 12:53:08,606 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 12:53:08,606 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 12:53:08,606 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 12:53:08,606 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 12:53:08,606 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 12:53:08,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:53:08,607 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 12:53:08,608 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:53:08,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 12:53:08,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:53:08,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:53:08,608 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 12:53:08,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:53:08,608 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:53:08,608 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 12:53:08,609 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 12:53:08,609 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_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:08,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:53:08,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:53:08,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:53:08,638 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:53:08,638 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:53:08,639 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-12-09 12:53:08,677 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/data/806209999/676cb5f911cc46a19a2174a28a9ec7cd/FLAG21c27c92b [2018-12-09 12:53:09,006 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:53:09,006 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-12-09 12:53:09,010 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/data/806209999/676cb5f911cc46a19a2174a28a9ec7cd/FLAG21c27c92b [2018-12-09 12:53:09,412 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/data/806209999/676cb5f911cc46a19a2174a28a9ec7cd [2018-12-09 12:53:09,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:53:09,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:53:09,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:53:09,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:53:09,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:53:09,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cecaa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09, skipping insertion in model container [2018-12-09 12:53:09,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:53:09,440 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:53:09,536 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:53:09,538 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:53:09,550 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:53:09,558 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:53:09,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09 WrapperNode [2018-12-09 12:53:09,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:53:09,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:53:09,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:53:09,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:53:09,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:53:09,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:53:09,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:53:09,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:53:09,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... [2018-12-09 12:53:09,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:53:09,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:53:09,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:53:09,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:53:09,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:53:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:53:09,800 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:53:09,801 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-12-09 12:53:09,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:53:09 BoogieIcfgContainer [2018-12-09 12:53:09,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:53:09,801 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 12:53:09,801 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 12:53:09,803 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 12:53:09,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:53:09,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:53:09" (1/3) ... [2018-12-09 12:53:09,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61e21640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:53:09, skipping insertion in model container [2018-12-09 12:53:09,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:53:09,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:53:09" (2/3) ... [2018-12-09 12:53:09,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61e21640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:53:09, skipping insertion in model container [2018-12-09 12:53:09,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:53:09,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:53:09" (3/3) ... [2018-12-09 12:53:09,807 INFO L375 chiAutomizerObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-12-09 12:53:09,847 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:53:09,847 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 12:53:09,847 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 12:53:09,847 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 12:53:09,847 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:53:09,847 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:53:09,847 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 12:53:09,847 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:53:09,847 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 12:53:09,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-12-09 12:53:09,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-09 12:53:09,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:09,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:09,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 12:53:09,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:09,876 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 12:53:09,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-12-09 12:53:09,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-09 12:53:09,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:09,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:09,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 12:53:09,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:09,883 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue 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; 55#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; 31#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 40#L45-1true [2018-12-09 12:53:09,883 INFO L796 eck$LassoCheckResult]: Loop: 40#L45-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 53#L24-2true assume !true; 52#L24-3true assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 32#L4-30true assume !(0 == __VERIFIER_assert_~cond); 44#L4-32true __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; 42#L4-33true assume !(0 == __VERIFIER_assert_~cond); 39#L4-35true main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 40#L45-1true [2018-12-09 12:53:09,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:09,886 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2018-12-09 12:53:09,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:09,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:09,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2018-12-09 12:53:09,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:09,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:09,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:09,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:53:09,982 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 12:53:09,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 12:53:09,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 12:53:09,992 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-09 12:53:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:09,997 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-12-09 12:53:09,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 12:53:09,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2018-12-09 12:53:10,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-09 12:53:10,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2018-12-09 12:53:10,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-09 12:53:10,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-09 12:53:10,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-12-09 12:53:10,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:53:10,003 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-09 12:53:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-12-09 12:53:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 12:53:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 12:53:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-12-09 12:53:10,021 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-09 12:53:10,021 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-09 12:53:10,021 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 12:53:10,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-12-09 12:53:10,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-09 12:53:10,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:10,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:10,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 12:53:10,022 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:10,022 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY 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; 148#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; 116#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 117#L45-1 [2018-12-09 12:53:10,022 INFO L796 eck$LassoCheckResult]: Loop: 117#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 124#L24-2 assume !(main_~j~0 <= main_~r~0); 144#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 129#L4-36 assume !(0 == __VERIFIER_assert_~cond); 130#L4-38 __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; 143#L4-39 assume !(0 == __VERIFIER_assert_~cond); 141#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 117#L45-1 [2018-12-09 12:53:10,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2018-12-09 12:53:10,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:10,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2018-12-09 12:53:10,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:10,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:53:10,061 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 12:53:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:53:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:53:10,062 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-09 12:53:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:10,152 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-12-09 12:53:10,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:53:10,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2018-12-09 12:53:10,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-09 12:53:10,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2018-12-09 12:53:10,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-12-09 12:53:10,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-12-09 12:53:10,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2018-12-09 12:53:10,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:53:10,155 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-12-09 12:53:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2018-12-09 12:53:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2018-12-09 12:53:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 12:53:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-09 12:53:10,157 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-09 12:53:10,157 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-09 12:53:10,157 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 12:53:10,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2018-12-09 12:53:10,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-12-09 12:53:10,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:10,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:10,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 12:53:10,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:10,158 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY 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; 264#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; 230#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 231#L45-1 [2018-12-09 12:53:10,158 INFO L796 eck$LassoCheckResult]: Loop: 231#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 247#L24-2 assume !(main_~j~0 <= main_~r~0); 262#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 234#L4-30 assume !(0 == __VERIFIER_assert_~cond); 235#L4-32 __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; 250#L4-33 assume !(0 == __VERIFIER_assert_~cond); 246#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 231#L45-1 [2018-12-09 12:53:10,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2018-12-09 12:53:10,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2018-12-09 12:53:10,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:10,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,178 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2018-12-09 12:53:10,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:10,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:10,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:53:10,299 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:10,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:10,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:10,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:10,300 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 12:53:10,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:10,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:10,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:10,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-12-09 12:53:10,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:10,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:10,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:10,385 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:10,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:10,389 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:10,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 12:53:10,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:10,619 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 12:53:10,620 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:10,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:10,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:10,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:10,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:53:10,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:10,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:10,620 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:10,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration3_Loop [2018-12-09 12:53:10,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:10,621 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:10,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,668 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:10,671 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:53:10,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:10,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:10,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:10,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:10,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:10,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:10,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:10,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:10,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:10,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:10,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:10,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:10,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:10,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:10,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:10,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:10,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:10,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:10,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:10,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:10,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:10,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:10,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:10,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:10,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:10,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:10,687 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:53:10,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 12:53:10,692 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 12:53:10,694 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:53:10,694 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:53:10,694 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:53:10,694 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-12-09 12:53:10,695 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 12:53:10,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:10,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:10,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:10,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:53:10,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 12:53:10,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 111 states and 132 transitions. Complement of second has 6 states. [2018-12-09 12:53:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 12:53:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 12:53:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-12-09 12:53:10,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2018-12-09 12:53:10,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:10,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2018-12-09 12:53:10,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:10,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2018-12-09 12:53:10,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:10,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2018-12-09 12:53:10,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-12-09 12:53:10,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2018-12-09 12:53:10,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-12-09 12:53:10,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-12-09 12:53:10,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2018-12-09 12:53:10,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:10,781 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2018-12-09 12:53:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2018-12-09 12:53:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-09 12:53:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 12:53:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2018-12-09 12:53:10,785 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2018-12-09 12:53:10,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:53:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:53:10,785 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2018-12-09 12:53:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:10,798 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2018-12-09 12:53:10,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:53:10,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2018-12-09 12:53:10,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2018-12-09 12:53:10,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2018-12-09 12:53:10,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-12-09 12:53:10,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2018-12-09 12:53:10,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2018-12-09 12:53:10,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:53:10,801 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-12-09 12:53:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2018-12-09 12:53:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2018-12-09 12:53:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 12:53:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-12-09 12:53:10,803 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-09 12:53:10,803 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-09 12:53:10,803 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 12:53:10,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2018-12-09 12:53:10,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-12-09 12:53:10,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:10,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:10,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 12:53:10,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:10,805 INFO L794 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY 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; 699#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; 665#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 666#L45-1 [2018-12-09 12:53:10,805 INFO L796 eck$LassoCheckResult]: Loop: 666#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 705#L24-2 assume !(main_~j~0 <= main_~r~0); 703#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 670#L4-30 assume !(0 == __VERIFIER_assert_~cond); 671#L4-32 __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; 686#L4-33 assume !(0 == __VERIFIER_assert_~cond); 682#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 666#L45-1 [2018-12-09 12:53:10,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2018-12-09 12:53:10,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2018-12-09 12:53:10,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:10,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2018-12-09 12:53:10,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:10,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:10,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:10,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:10,915 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:10,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:10,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:10,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:10,916 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 12:53:10,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:10,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:10,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:10,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2018-12-09 12:53:10,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:10,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:10,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:10,976 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:10,977 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:10,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:10,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:10,982 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 12:53:10,982 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_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:10,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:10,998 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:11,015 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 12:53:11,015 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:11,190 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 12:53:11,192 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:11,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:11,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:11,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:11,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:53:11,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:11,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:11,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:11,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration4_Loop [2018-12-09 12:53:11,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:11,192 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:11,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,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-12-09 12:53:11,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,243 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:11,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:53:11,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:11,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:11,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:11,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:11,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:11,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:11,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:11,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:11,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:11,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:11,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:11,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:11,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:11,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:11,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:11,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:11,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:11,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:53:11,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 12:53:11,253 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 12:53:11,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:53:11,253 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:53:11,253 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:53:11,253 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2018-12-09 12:53:11,254 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 12:53:11,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:11,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:11,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:11,277 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:53:11,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-09 12:53:11,292 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 155 states and 181 transitions. Complement of second has 6 states. [2018-12-09 12:53:11,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 12:53:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 12:53:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-12-09 12:53:11,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2018-12-09 12:53:11,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:11,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2018-12-09 12:53:11,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:11,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2018-12-09 12:53:11,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:11,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2018-12-09 12:53:11,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2018-12-09 12:53:11,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2018-12-09 12:53:11,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-12-09 12:53:11,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-12-09 12:53:11,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2018-12-09 12:53:11,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:11,297 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-12-09 12:53:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2018-12-09 12:53:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2018-12-09 12:53:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 12:53:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-12-09 12:53:11,299 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-12-09 12:53:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:11,299 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2018-12-09 12:53:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:11,381 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2018-12-09 12:53:11,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:53:11,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2018-12-09 12:53:11,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2018-12-09 12:53:11,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2018-12-09 12:53:11,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2018-12-09 12:53:11,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2018-12-09 12:53:11,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2018-12-09 12:53:11,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:11,385 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-12-09 12:53:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2018-12-09 12:53:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2018-12-09 12:53:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 12:53:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-12-09 12:53:11,388 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-09 12:53:11,389 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-12-09 12:53:11,389 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 12:53:11,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2018-12-09 12:53:11,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-09 12:53:11,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:11,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:11,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 12:53:11,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:11,390 INFO L794 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY 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; 1260#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; 1203#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1205#L45-1 [2018-12-09 12:53:11,390 INFO L796 eck$LassoCheckResult]: Loop: 1205#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1232#L24-2 assume !!(main_~j~0 <= main_~r~0); 1239#L25 assume !(main_~j~0 < main_~r~0); 1236#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1234#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1228#L4-14 __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; 1222#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1223#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1253#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1226#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-38 __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; 1252#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1249#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1205#L45-1 [2018-12-09 12:53:11,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2018-12-09 12:53:11,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:11,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:11,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:11,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2018-12-09 12:53:11,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:11,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:11,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:11,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2018-12-09 12:53:11,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:11,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:11,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:11,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:11,587 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:11,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:11,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:11,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:11,587 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 12:53:11,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:11,588 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:11,588 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:11,588 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-12-09 12:53:11,588 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:11,588 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:11,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:11,652 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:11,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:11,665 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:11,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 12:53:11,682 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:11,707 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 12:53:11,708 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:11,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:11,709 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:11,709 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:11,709 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:53:11,709 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:11,709 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:11,709 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:11,709 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration5_Loop [2018-12-09 12:53:11,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:11,710 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:11,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:11,781 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:11,782 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:53:11,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:11,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:11,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:11,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:11,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:11,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:11,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:11,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:11,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:53:11,787 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 12:53:11,787 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 12:53:11,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:53:11,787 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:53:11,787 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:53:11,787 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-12-09 12:53:11,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 12:53:11,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:11,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:11,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:11,810 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:53:11,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-09 12:53:11,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 124 states and 144 transitions. Complement of second has 4 states. [2018-12-09 12:53:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 12:53:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 12:53:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-12-09 12:53:11,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2018-12-09 12:53:11,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:11,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2018-12-09 12:53:11,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:11,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2018-12-09 12:53:11,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:11,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2018-12-09 12:53:11,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-12-09 12:53:11,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2018-12-09 12:53:11,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-12-09 12:53:11,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-12-09 12:53:11,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2018-12-09 12:53:11,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:11,828 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-12-09 12:53:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2018-12-09 12:53:11,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-09 12:53:11,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 12:53:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2018-12-09 12:53:11,830 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2018-12-09 12:53:11,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:53:11,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:53:11,831 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 5 states. [2018-12-09 12:53:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:11,854 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-12-09 12:53:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:53:11,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 77 transitions. [2018-12-09 12:53:11,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-09 12:53:11,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 64 states and 74 transitions. [2018-12-09 12:53:11,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-09 12:53:11,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-09 12:53:11,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2018-12-09 12:53:11,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:11,856 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-09 12:53:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2018-12-09 12:53:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-09 12:53:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 12:53:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-12-09 12:53:11,857 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-09 12:53:11,857 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-09 12:53:11,857 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 12:53:11,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2018-12-09 12:53:11,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-09 12:53:11,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:11,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:11,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 12:53:11,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:11,858 INFO L794 eck$LassoCheckResult]: Stem: 1705#ULTIMATE.startENTRY 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; 1706#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; 1649#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1650#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1678#L24-2 [2018-12-09 12:53:11,858 INFO L796 eck$LassoCheckResult]: Loop: 1678#L24-2 assume !!(main_~j~0 <= main_~r~0); 1685#L25 assume !(main_~j~0 < main_~r~0); 1680#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1681#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1673#L4-14 __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; 1667#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1668#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1699#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1671#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1672#L4-38 __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; 1698#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1695#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1677#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1678#L24-2 [2018-12-09 12:53:11,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2018-12-09 12:53:11,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:11,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2018-12-09 12:53:11,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:11,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:11,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2018-12-09 12:53:11,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:11,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:11,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:11,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:53:12,022 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:12,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:12,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:12,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:12,022 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 12:53:12,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:12,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:12,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:12,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-12-09 12:53:12,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:12,023 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:12,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,069 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:12,070 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:12,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:12,072 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:12,074 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 12:53:12,074 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_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:12,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:12,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:12,093 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 12:53:12,093 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_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:12,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:12,111 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:12,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 12:53:12,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:12,366 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 12:53:12,368 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:12,368 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:12,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:12,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:12,369 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:53:12,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:12,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:12,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:12,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration6_Loop [2018-12-09 12:53:12,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:12,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:12,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:12,423 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:12,423 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:53:12,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:12,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:12,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:12,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:12,424 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 12:53:12,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:12,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 12:53:12,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:12,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:12,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:12,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:12,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:12,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:12,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:12,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:12,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:12,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:12,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:12,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:12,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:12,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:12,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:12,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:12,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:12,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:12,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:12,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:12,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:12,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:12,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:12,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:12,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:12,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:12,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:12,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:12,436 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:53:12,438 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 12:53:12,438 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 12:53:12,438 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:53:12,439 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:53:12,439 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:53:12,439 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2018-12-09 12:53:12,439 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 12:53:12,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:12,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:12,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:12,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-12-09 12:53:12,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:53:12,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-09 12:53:12,485 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 128 states and 150 transitions. Complement of second has 6 states. [2018-12-09 12:53:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 12:53:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 12:53:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-12-09 12:53:12,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2018-12-09 12:53:12,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:12,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2018-12-09 12:53:12,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:12,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2018-12-09 12:53:12,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:12,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2018-12-09 12:53:12,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 12:53:12,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2018-12-09 12:53:12,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-09 12:53:12,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-09 12:53:12,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2018-12-09 12:53:12,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:12,489 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2018-12-09 12:53:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2018-12-09 12:53:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-12-09 12:53:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 12:53:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-12-09 12:53:12,492 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-12-09 12:53:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:53:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:12,493 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2018-12-09 12:53:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:12,581 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2018-12-09 12:53:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:53:12,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2018-12-09 12:53:12,583 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2018-12-09 12:53:12,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2018-12-09 12:53:12,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-12-09 12:53:12,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-12-09 12:53:12,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2018-12-09 12:53:12,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:12,584 INFO L705 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2018-12-09 12:53:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2018-12-09 12:53:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2018-12-09 12:53:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 12:53:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2018-12-09 12:53:12,586 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2018-12-09 12:53:12,587 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2018-12-09 12:53:12,587 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 12:53:12,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2018-12-09 12:53:12,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 12:53:12,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:12,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:12,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 12:53:12,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:12,588 INFO L794 eck$LassoCheckResult]: Stem: 2509#ULTIMATE.startENTRY 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; 2510#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; 2450#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2451#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2480#L24-2 assume !!(main_~j~0 <= main_~r~0); 2488#L25 [2018-12-09 12:53:12,588 INFO L796 eck$LassoCheckResult]: Loop: 2488#L25 assume !(main_~j~0 < main_~r~0); 2483#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2484#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2475#L4-14 __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; 2469#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2470#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2500#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2496#L4-20 __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; 2492#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2493#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2514#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2507#L4-26 __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; 2467#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2461#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2462#L24-2 assume !!(main_~j~0 <= main_~r~0); 2488#L25 [2018-12-09 12:53:12,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2018-12-09 12:53:12,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:12,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:12,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:12,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:12,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2018-12-09 12:53:12,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:12,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:53:12,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:53:12,634 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 12:53:12,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:53:12,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:53:12,635 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2018-12-09 12:53:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:12,708 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2018-12-09 12:53:12,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:53:12,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 238 transitions. [2018-12-09 12:53:12,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 12:53:12,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 198 states and 224 transitions. [2018-12-09 12:53:12,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-09 12:53:12,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 12:53:12,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 224 transitions. [2018-12-09 12:53:12,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:12,710 INFO L705 BuchiCegarLoop]: Abstraction has 198 states and 224 transitions. [2018-12-09 12:53:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 224 transitions. [2018-12-09 12:53:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 163. [2018-12-09 12:53:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-09 12:53:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2018-12-09 12:53:12,711 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2018-12-09 12:53:12,712 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2018-12-09 12:53:12,712 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 12:53:12,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2018-12-09 12:53:12,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 12:53:12,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:12,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:12,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 12:53:12,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:12,713 INFO L794 eck$LassoCheckResult]: Stem: 2862#ULTIMATE.startENTRY 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; 2863#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; 2800#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2801#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2830#L24-2 assume !!(main_~j~0 <= main_~r~0); 2838#L25 [2018-12-09 12:53:12,713 INFO L796 eck$LassoCheckResult]: Loop: 2838#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2839#L4 assume !(0 == __VERIFIER_assert_~cond); 2871#L4-2 __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; 2867#L4-3 assume !(0 == __VERIFIER_assert_~cond); 2857#L4-5 __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; 2814#L4-6 assume !(0 == __VERIFIER_assert_~cond); 2808#L4-8 __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; 2802#L4-9 assume !(0 == __VERIFIER_assert_~cond); 2803#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 2833#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2834#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2826#L4-14 __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; 2820#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2821#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2852#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2848#L4-20 __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; 2844#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2845#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2869#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2860#L4-26 __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; 2817#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2810#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2811#L24-2 assume !!(main_~j~0 <= main_~r~0); 2838#L25 [2018-12-09 12:53:12,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2018-12-09 12:53:12,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:12,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:12,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:12,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:12,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2018-12-09 12:53:12,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:12,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:12,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2018-12-09 12:53:12,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:12,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:12,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:53:12,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:53:12,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:12,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:12,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 12:53:12,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-12-09 12:53:13,015 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-09 12:53:13,015 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-12-09 12:53:13,454 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2018-12-09 12:53:13,455 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:13,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:13,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:13,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:13,456 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 12:53:13,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:13,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:13,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:13,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-12-09 12:53:13,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:13,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:13,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:13,501 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:13,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:13,503 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:13,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 12:53:13,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:13,614 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 12:53:13,615 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:13,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:13,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:13,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:13,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:53:13,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:13,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:13,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:13,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration8_Loop [2018-12-09 12:53:13,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:13,616 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:13,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:13,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:13,666 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:53:13,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:13,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:13,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:13,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:13,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:13,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:13,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:13,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:13,670 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:53:13,674 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 12:53:13,674 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 12:53:13,675 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:53:13,675 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:53:13,675 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:53:13,675 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 5*ULTIMATE.start_main_~r~0 - 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-09 12:53:13,675 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 12:53:13,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:13,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:13,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:13,742 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-12-09 12:53:13,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-09 12:53:13,968 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 811 states and 884 transitions. Complement of second has 19 states. [2018-12-09 12:53:13,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-09 12:53:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 12:53:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2018-12-09 12:53:13,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 23 letters. [2018-12-09 12:53:13,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:13,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 28 letters. Loop has 23 letters. [2018-12-09 12:53:13,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:13,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 108 transitions. Stem has 5 letters. Loop has 46 letters. [2018-12-09 12:53:13,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:13,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 811 states and 884 transitions. [2018-12-09 12:53:13,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2018-12-09 12:53:13,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 811 states to 644 states and 708 transitions. [2018-12-09 12:53:13,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-12-09 12:53:13,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-12-09 12:53:13,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 644 states and 708 transitions. [2018-12-09 12:53:13,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:13,975 INFO L705 BuchiCegarLoop]: Abstraction has 644 states and 708 transitions. [2018-12-09 12:53:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states and 708 transitions. [2018-12-09 12:53:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 409. [2018-12-09 12:53:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-09 12:53:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2018-12-09 12:53:13,979 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2018-12-09 12:53:13,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:53:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:53:13,980 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 12 states. [2018-12-09 12:53:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:53:15,078 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2018-12-09 12:53:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:53:15,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2018-12-09 12:53:15,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 12:53:15,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2018-12-09 12:53:15,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 12:53:15,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 12:53:15,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2018-12-09 12:53:15,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:53:15,083 INFO L705 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2018-12-09 12:53:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2018-12-09 12:53:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2018-12-09 12:53:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-09 12:53:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2018-12-09 12:53:15,087 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2018-12-09 12:53:15,087 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2018-12-09 12:53:15,087 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 12:53:15,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2018-12-09 12:53:15,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 12:53:15,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:53:15,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:53:15,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:15,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:53:15,089 INFO L794 eck$LassoCheckResult]: Stem: 5083#ULTIMATE.startENTRY 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; 5084#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; 5020#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5021#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5050#L24-2 assume !!(main_~j~0 <= main_~r~0); 5171#L25 assume !(main_~j~0 < main_~r~0); 5055#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5056#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5047#L4-14 __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; 5042#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5043#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 5074#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5082#L4-30 assume !(0 == __VERIFIER_assert_~cond); 5143#L4-32 __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; 5140#L4-33 assume !(0 == __VERIFIER_assert_~cond); 5139#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 5103#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5032#L24-2 [2018-12-09 12:53:15,090 INFO L796 eck$LassoCheckResult]: Loop: 5032#L24-2 assume !!(main_~j~0 <= main_~r~0); 5060#L25 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5061#L4 assume !(0 == __VERIFIER_assert_~cond); 5093#L4-2 __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; 5087#L4-3 assume !(0 == __VERIFIER_assert_~cond); 5076#L4-5 __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; 5035#L4-6 assume !(0 == __VERIFIER_assert_~cond); 5028#L4-8 __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; 5022#L4-9 assume !(0 == __VERIFIER_assert_~cond); 5023#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 5053#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5054#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5046#L4-14 __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; 5040#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5041#L4-17 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5071#L4-18 assume !(0 == __VERIFIER_assert_~cond); 5067#L4-20 __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; 5063#L4-21 assume !(0 == __VERIFIER_assert_~cond); 5064#L4-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5090#L4-24 assume !(0 == __VERIFIER_assert_~cond); 5079#L4-26 __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; 5038#L4-27 assume !(0 == __VERIFIER_assert_~cond); 5031#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5032#L24-2 [2018-12-09 12:53:15,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:15,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2018-12-09 12:53:15,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:15,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:15,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:15,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2018-12-09 12:53:15,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:15,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:15,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:15,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:53:15,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:15,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2018-12-09 12:53:15,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:53:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:53:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:15,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:53:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:53:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:53:15,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-12-09 12:53:15,561 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:15,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:15,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:15,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:15,562 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 12:53:15,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:15,562 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:15,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:15,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-12-09 12:53:15,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:15,562 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:15,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:15,606 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:15,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:15,608 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:15,611 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 12:53:15,611 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:15,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:15,626 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:15,628 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 12:53:15,629 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_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:15,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:15,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:15,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 12:53:15,646 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_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:15,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 12:53:15,662 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06a7c825-915f-4c6f-850e-8d015f6a7e52/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-12-09 12:53:15,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 12:53:15,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 12:53:15,757 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 12:53:15,758 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:53:15,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:53:15,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:53:15,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:53:15,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:53:15,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:53:15,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:53:15,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:53:15,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort_true-unreach-call_true-termination.i_Iteration9_Loop [2018-12-09 12:53:15,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:53:15,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:53:15,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:53:15,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:53:15,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:53:15,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:15,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:15,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:15,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:15,805 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 12:53:15,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:15,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 12:53:15,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:15,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:15,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:15,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:15,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:15,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:15,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:15,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:15,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:15,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:15,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:15,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:15,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:15,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:15,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:15,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:15,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:15,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:15,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:15,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:53:15,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:53:15,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:53:15,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:53:15,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:53:15,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:53:15,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:53:15,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:53:15,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:53:15,813 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:53:15,816 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 12:53:15,817 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 12:53:15,817 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:53:15,817 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:53:15,817 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:53:15,817 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~r~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-09 12:53:15,818 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 12:53:15,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:15,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:15,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:15,882 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-12-09 12:53:15,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-12-09 12:53:15,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 408 states and 452 transitions. Complement of second has 13 states. [2018-12-09 12:53:15,942 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-12-09 12:53:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 12:53:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-12-09 12:53:15,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 23 letters. [2018-12-09 12:53:15,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:15,942 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:53:15,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:15,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:15,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:16,010 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-12-09 12:53:16,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-12-09 12:53:16,090 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 434 states and 478 transitions. Complement of second has 15 states. [2018-12-09 12:53:16,090 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-12-09 12:53:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 12:53:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-12-09 12:53:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 17 letters. Loop has 23 letters. [2018-12-09 12:53:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:16,091 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:53:16,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:16,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:16,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:16,146 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-12-09 12:53:16,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-12-09 12:53:16,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 811 states and 904 transitions. Complement of second has 13 states. [2018-12-09 12:53:16,218 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-12-09 12:53:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 12:53:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-12-09 12:53:16,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 104 transitions. Stem has 17 letters. Loop has 23 letters. [2018-12-09 12:53:16,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:16,219 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:53:16,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:53:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:16,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:16,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:53:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:16,277 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-09 12:53:16,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-12-09 12:53:16,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 699 states and 769 transitions. Complement of second has 14 states. [2018-12-09 12:53:16,349 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-12-09 12:53:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 12:53:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-12-09 12:53:16,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 23 letters. [2018-12-09 12:53:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:16,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 40 letters. Loop has 23 letters. [2018-12-09 12:53:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:16,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 46 letters. [2018-12-09 12:53:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:53:16,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 769 transitions. [2018-12-09 12:53:16,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 12:53:16,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 0 states and 0 transitions. [2018-12-09 12:53:16,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 12:53:16,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 12:53:16,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 12:53:16,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:53:16,353 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:53:16,353 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:53:16,353 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:53:16,353 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 12:53:16,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 12:53:16,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 12:53:16,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 12:53:16,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:53:16 BoogieIcfgContainer [2018-12-09 12:53:16,357 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 12:53:16,358 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:53:16,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:53:16,358 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:53:16,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:53:09" (3/4) ... [2018-12-09 12:53:16,360 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 12:53:16,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:53:16,361 INFO L168 Benchmark]: Toolchain (without parser) took 6945.96 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -103.7 MB). Peak memory consumption was 225.0 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:16,361 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:53:16,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.21 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:16,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.40 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:16,362 INFO L168 Benchmark]: Boogie Preprocessor took 13.29 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:53:16,363 INFO L168 Benchmark]: RCFGBuilder took 206.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:16,363 INFO L168 Benchmark]: BuchiAutomizer took 6556.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:53:16,363 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:53:16,365 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.21 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.40 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.29 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 206.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6556.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. 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 (8 trivial, 5 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 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function 5 * r + -8 * j and consists of 10 locations. One nondeterministic module has affine ranking function r + -1 * j and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 1.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, 13 MinimizatonAttempts, 849 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 210 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 785 SDtfs, 1359 SDslu, 1002 SDs, 0 SdLazy, 1291 SolverSat, 167 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital37 mio100 ax100 hnf97 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp97 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 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...