./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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.24-cad4683 [2019-11-15 22:41:22,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:41:22,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:41:22,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:41:22,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:41:22,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:41:22,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:41:22,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:41:22,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:41:22,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:41:22,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:41:22,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:41:22,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:41:22,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:41:22,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:41:22,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:41:22,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:41:22,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:41:22,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:41:22,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:41:22,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:41:22,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:41:22,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:41:22,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:41:22,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:41:22,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:41:22,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:41:22,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:41:22,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:41:22,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:41:22,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:41:22,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:41:22,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:41:22,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:41:22,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:41:22,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:41:22,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:41:22,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:41:22,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:41:22,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:41:22,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:41:22,721 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:41:22,751 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:41:22,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:41:22,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:41:22,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:41:22,753 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:41:22,754 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:41:22,754 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:41:22,754 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:41:22,754 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:41:22,755 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:41:22,755 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:41:22,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:41:22,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:41:22,756 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:41:22,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:41:22,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:41:22,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:41:22,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:41:22,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:41:22,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:41:22,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:41:22,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:41:22,758 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:41:22,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:41:22,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:41:22,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:41:22,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:41:22,759 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:41:22,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:41:22,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:41:22,760 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:41:22,761 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:41:22,761 INFO L138 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/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:22,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:41:22,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:41:22,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:41:22,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:41:22,814 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:41:22,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-15 22:41:22,872 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/data/31b3adccc/cd9be79349f84bf9a5a8a50728e46e28/FLAGfd6c7044e [2019-11-15 22:41:23,285 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:41:23,285 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-15 22:41:23,292 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/data/31b3adccc/cd9be79349f84bf9a5a8a50728e46e28/FLAGfd6c7044e [2019-11-15 22:41:23,710 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/data/31b3adccc/cd9be79349f84bf9a5a8a50728e46e28 [2019-11-15 22:41:23,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:41:23,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:41:23,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:41:23,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:41:23,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:41:23,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:41:23" (1/1) ... [2019-11-15 22:41:23,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11aa7ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:23, skipping insertion in model container [2019-11-15 22:41:23,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:41:23" (1/1) ... [2019-11-15 22:41:23,737 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:41:23,761 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:41:24,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:41:24,096 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:41:24,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:41:24,156 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:41:24,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24 WrapperNode [2019-11-15 22:41:24,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:41:24,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:41:24,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:41:24,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:41:24,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:41:24,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:41:24,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:41:24,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:41:24,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... [2019-11-15 22:41:24,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:41:24,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:41:24,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:41:24,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:41:24,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:41:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:41:24,673 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:41:24,674 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-15 22:41:24,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:41:24 BoogieIcfgContainer [2019-11-15 22:41:24,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:41:24,676 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:41:24,676 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:41:24,679 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:41:24,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:41:24,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:41:23" (1/3) ... [2019-11-15 22:41:24,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@532f6ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:41:24, skipping insertion in model container [2019-11-15 22:41:24,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:41:24,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:24" (2/3) ... [2019-11-15 22:41:24,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@532f6ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:41:24, skipping insertion in model container [2019-11-15 22:41:24,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:41:24,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:41:24" (3/3) ... [2019-11-15 22:41:24,683 INFO L371 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2019-11-15 22:41:24,735 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:41:24,735 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:41:24,735 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:41:24,736 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:41:24,736 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:41:24,736 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:41:24,736 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:41:24,736 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:41:24,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-15 22:41:24,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-15 22:41:24,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:24,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:24,787 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:41:24,787 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:24,787 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:41:24,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-15 22:41:24,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-15 22:41:24,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:24,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:24,792 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:41:24,792 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:24,798 INFO L791 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 [2019-11-15 22:41:24,799 INFO L793 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 [2019-11-15 22:41:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-11-15 22:41:24,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:24,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505294990] [2019-11-15 22:41:24,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:24,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:24,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:24,932 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-11-15 22:41:24,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:24,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741502209] [2019-11-15 22:41:24,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:24,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:24,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:24,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741502209] [2019-11-15 22:41:24,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:24,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:41:24,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147116474] [2019-11-15 22:41:24,972 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:41:24,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:41:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:41:24,989 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-11-15 22:41:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:24,998 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-15 22:41:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:41:25,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-11-15 22:41:25,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-15 22:41:25,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-11-15 22:41:25,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-15 22:41:25,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 22:41:25,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-11-15 22:41:25,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:41:25,012 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-15 22:41:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-11-15 22:41:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 22:41:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 22:41:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-15 22:41:25,040 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-15 22:41:25,040 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-15 22:41:25,040 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:41:25,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-15 22:41:25,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-15 22:41:25,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:25,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:25,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:41:25,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:25,043 INFO L791 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 [2019-11-15 22:41:25,043 INFO L793 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 [2019-11-15 22:41:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-11-15 22:41:25,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:25,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177670637] [2019-11-15 22:41:25,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:25,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-11-15 22:41:25,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:25,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482038009] [2019-11-15 22:41:25,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:25,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482038009] [2019-11-15 22:41:25,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:25,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:41:25,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130237426] [2019-11-15 22:41:25,121 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:41:25,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:25,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:41:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:41:25,122 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 22:41:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:25,305 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-11-15 22:41:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:41:25,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-11-15 22:41:25,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-15 22:41:25,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-11-15 22:41:25,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-15 22:41:25,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-11-15 22:41:25,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-11-15 22:41:25,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:41:25,320 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-11-15 22:41:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-11-15 22:41:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-11-15 22:41:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:41:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-15 22:41:25,329 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-15 22:41:25,334 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-15 22:41:25,335 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:41:25,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-11-15 22:41:25,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-15 22:41:25,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:25,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:25,339 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:41:25,339 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:25,339 INFO L791 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 [2019-11-15 22:41:25,340 INFO L793 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 [2019-11-15 22:41:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:25,341 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-11-15 22:41:25,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:25,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707811641] [2019-11-15 22:41:25,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:25,387 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-11-15 22:41:25,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:25,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603512003] [2019-11-15 22:41:25,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:25,410 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-11-15 22:41:25,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:25,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556995224] [2019-11-15 22:41:25,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:25,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556995224] [2019-11-15 22:41:25,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:25,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:41:25,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253873157] [2019-11-15 22:41:25,636 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-11-15 22:41:25,649 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:25,650 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:25,650 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:25,650 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:25,651 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:41:25,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:25,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:25,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:25,651 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-15 22:41:25,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:25,653 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:25,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:25,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:25,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:25,801 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:25,802 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:25,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:25,812 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:25,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:41:25,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:41:26,111 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:41:26,114 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:26,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:26,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:26,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:26,114 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:26,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:26,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:26,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:26,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-15 22:41:26,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:26,115 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:26,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:26,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:26,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:26,257 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:26,264 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:26,266 INFO L120 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 [2019-11-15 22:41:26,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:26,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:26,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:26,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:26,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:26,274 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:26,274 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:26,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:26,288 INFO L120 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 [2019-11-15 22:41:26,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:26,290 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:26,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:26,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:26,291 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:26,292 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:26,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:26,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:26,317 INFO L120 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 [2019-11-15 22:41:26,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:26,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:26,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:26,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:26,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:26,320 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:26,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:26,334 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:26,358 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:41:26,366 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:41:26,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:26,370 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:41:26,370 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:26,371 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-11-15 22:41:26,373 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:41:26,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:26,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:26,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:26,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:41:26,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:26,453 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 [2019-11-15 22:41:26,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 22:41:26,537 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. [2019-11-15 22:41:26,540 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 [2019-11-15 22:41:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:41:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-11-15 22:41:26,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-15 22:41:26,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:26,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-15 22:41:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:26,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-15 22:41:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:26,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-11-15 22:41:26,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-11-15 22:41:26,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-11-15 22:41:26,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-15 22:41:26,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-11-15 22:41:26,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-11-15 22:41:26,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:26,557 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-11-15 22:41:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-11-15 22:41:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-15 22:41:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 22:41:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-15 22:41:26,568 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-15 22:41:26,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:41:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:41:26,569 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-11-15 22:41:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:26,600 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-11-15 22:41:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:41:26,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-11-15 22:41:26,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-11-15 22:41:26,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-11-15 22:41:26,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-15 22:41:26,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-15 22:41:26,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-11-15 22:41:26,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:41:26,607 INFO L688 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-11-15 22:41:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-11-15 22:41:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-11-15 22:41:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 22:41:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-15 22:41:26,612 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-15 22:41:26,613 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-15 22:41:26,613 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:41:26,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-15 22:41:26,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-11-15 22:41:26,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:26,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:26,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:41:26,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:26,615 INFO L791 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 [2019-11-15 22:41:26,615 INFO L793 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 [2019-11-15 22:41:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-11-15 22:41:26,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:26,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206642808] [2019-11-15 22:41:26,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:26,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:26,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:26,634 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-11-15 22:41:26,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:26,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473103066] [2019-11-15 22:41:26,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:26,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:26,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:26,655 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-11-15 22:41:26,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:26,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221603465] [2019-11-15 22:41:26,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:26,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:26,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:26,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221603465] [2019-11-15 22:41:26,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:26,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:41:26,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455122495] [2019-11-15 22:41:26,875 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-11-15 22:41:26,876 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:26,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:26,877 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:26,877 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:26,877 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:41:26,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:26,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:26,877 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:26,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-15 22:41:26,878 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:26,878 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:26,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:26,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:26,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:26,991 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:26,991 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:41:27,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:27,011 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:27,022 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:41:27,022 INFO L440 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/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:41:27,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:27,044 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:41:27,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:41:27,086 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:27,474 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:41:27,476 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:27,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:27,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:27,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:27,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:27,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:27,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:27,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:27,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-15 22:41:27,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:27,478 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:27,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:27,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:27,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:27,644 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:27,644 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:27,645 INFO L120 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 [2019-11-15 22:41:27,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:27,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:27,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:27,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:27,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:27,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:27,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:27,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:27,652 INFO L120 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 [2019-11-15 22:41:27,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:27,653 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:27,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:27,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:27,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:27,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:27,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:27,664 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:27,671 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:41:27,671 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:41:27,672 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:27,672 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:41:27,672 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:27,673 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2019-11-15 22:41:27,673 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:41:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:27,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:27,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:27,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:41:27,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:27,744 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 [2019-11-15 22:41:27,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-11-15 22:41:27,789 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. [2019-11-15 22:41:27,791 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 [2019-11-15 22:41:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:41:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-11-15 22:41:27,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-15 22:41:27,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:27,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-15 22:41:27,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:27,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-15 22:41:27,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:27,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-11-15 22:41:27,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-11-15 22:41:27,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-11-15 22:41:27,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-15 22:41:27,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-11-15 22:41:27,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-11-15 22:41:27,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:27,805 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-15 22:41:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-11-15 22:41:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-11-15 22:41:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 22:41:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-15 22:41:27,818 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-15 22:41:27,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:27,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:41:27,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:41:27,819 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-11-15 22:41:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:28,068 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-11-15 22:41:28,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:41:28,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-11-15 22:41:28,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-11-15 22:41:28,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-11-15 22:41:28,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-15 22:41:28,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-11-15 22:41:28,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-11-15 22:41:28,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:28,081 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-11-15 22:41:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-11-15 22:41:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-11-15 22:41:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 22:41:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-15 22:41:28,092 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-15 22:41:28,092 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-15 22:41:28,092 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:41:28,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-15 22:41:28,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-15 22:41:28,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:28,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:28,094 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:41:28,094 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:28,094 INFO L791 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 [2019-11-15 22:41:28,094 INFO L793 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 [2019-11-15 22:41:28,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-11-15 22:41:28,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:28,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107559697] [2019-11-15 22:41:28,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,110 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:28,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-11-15 22:41:28,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:28,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072898240] [2019-11-15 22:41:28,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-11-15 22:41:28,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:28,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200649988] [2019-11-15 22:41:28,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:28,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200649988] [2019-11-15 22:41:28,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:28,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:41:28,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309894248] [2019-11-15 22:41:28,305 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-15 22:41:28,451 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-11-15 22:41:28,452 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:28,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:28,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:28,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:28,453 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:41:28,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:28,453 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:28,453 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:28,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-15 22:41:28,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:28,454 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:28,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,562 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:28,562 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:28,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:28,566 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:28,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:41:28,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:41:28,593 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:41:28,595 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:28,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:28,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:28,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:28,595 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:28,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:28,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:28,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:28,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-15 22:41:28,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:28,596 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:28,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:28,689 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:28,690 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:28,690 INFO L120 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 [2019-11-15 22:41:28,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:28,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:28,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:28,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:28,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:28,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:28,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:28,700 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:28,704 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:41:28,705 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:41:28,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:28,705 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:41:28,705 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:28,705 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-15 22:41:28,706 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:41:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:28,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:28,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:28,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:41:28,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:28,769 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 [2019-11-15 22:41:28,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 22:41:28,814 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. [2019-11-15 22:41:28,814 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 [2019-11-15 22:41:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:41:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-11-15 22:41:28,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-11-15 22:41:28,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:28,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-11-15 22:41:28,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:28,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-11-15 22:41:28,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:28,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-11-15 22:41:28,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-15 22:41:28,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-11-15 22:41:28,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-15 22:41:28,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-15 22:41:28,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-11-15 22:41:28,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:28,821 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-11-15 22:41:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-11-15 22:41:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-11-15 22:41:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 22:41:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-11-15 22:41:28,836 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-11-15 22:41:28,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:28,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:41:28,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:41:28,837 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 4 states. [2019-11-15 22:41:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:28,879 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-15 22:41:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:41:28,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 75 transitions. [2019-11-15 22:41:28,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-15 22:41:28,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 74 transitions. [2019-11-15 22:41:28,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-15 22:41:28,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-15 22:41:28,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-11-15 22:41:28,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:28,882 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-15 22:41:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-11-15 22:41:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-15 22:41:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 22:41:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-15 22:41:28,885 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-15 22:41:28,885 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-15 22:41:28,885 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:41:28,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-11-15 22:41:28,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-15 22:41:28,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:28,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:28,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:41:28,887 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:28,887 INFO L791 eck$LassoCheckResult]: Stem: 1702#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; 1703#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; 1646#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 1647#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-11-15 22:41:28,887 INFO L793 eck$LassoCheckResult]: Loop: 1675#L24-2 assume !!(main_~j~0 <= main_~r~0); 1682#L25 assume !(main_~j~0 < main_~r~0); 1677#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; 1678#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1670#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; 1664#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1665#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1696#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; 1668#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1669#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; 1695#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1692#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1674#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1675#L24-2 [2019-11-15 22:41:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-11-15 22:41:28,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:28,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088922746] [2019-11-15 22:41:28,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,903 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-11-15 22:41:28,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:28,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025916500] [2019-11-15 22:41:28,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:28,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:28,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-11-15 22:41:28,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:28,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227654450] [2019-11-15 22:41:28,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:28,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:28,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227654450] [2019-11-15 22:41:28,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:28,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:41:28,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282844422] [2019-11-15 22:41:29,218 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-11-15 22:41:29,219 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:29,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:29,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:29,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:29,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:41:29,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:29,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:29,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:29,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-15 22:41:29,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:29,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:29,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,320 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:29,321 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:41:29,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:29,337 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:29,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:41:29,343 INFO L440 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/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:29,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:29,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:41:29,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:41:29,369 INFO L440 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/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:41:29,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:29,384 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:41:29,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:41:29,449 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:29,732 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:41:29,735 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:29,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:29,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:29,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:29,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:29,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:29,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:29,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:29,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-15 22:41:29,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:29,735 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:29,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:29,831 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:29,832 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:29,832 INFO L120 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 [2019-11-15 22:41:29,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:29,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:29,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:29,833 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:41:29,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:29,834 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 22:41:29,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:29,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:29,836 INFO L120 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 [2019-11-15 22:41:29,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:29,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:29,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:29,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:29,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:29,838 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:29,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:29,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:29,840 INFO L120 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 [2019-11-15 22:41:29,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:29,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:29,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:29,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:29,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:29,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:29,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:29,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:29,843 INFO L120 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 [2019-11-15 22:41:29,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:29,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:29,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:29,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:29,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:29,846 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:29,846 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:29,851 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:29,855 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:41:29,856 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:41:29,856 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:29,856 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:41:29,857 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:29,857 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-15 22:41:29,857 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:41:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:29,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:29,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:29,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:41:29,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:29,905 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 [2019-11-15 22:41:29,905 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-15 22:41:29,945 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. [2019-11-15 22:41:29,945 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 [2019-11-15 22:41:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:41:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-11-15 22:41:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-11-15 22:41:29,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-11-15 22:41:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-11-15 22:41:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:29,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-11-15 22:41:29,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-15 22:41:29,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-11-15 22:41:29,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 22:41:29,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-15 22:41:29,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-11-15 22:41:29,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:29,950 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-11-15 22:41:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-11-15 22:41:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-15 22:41:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 22:41:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-11-15 22:41:29,954 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-15 22:41:29,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:29,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:29,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:29,955 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-11-15 22:41:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:30,139 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-11-15 22:41:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:41:30,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-11-15 22:41:30,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-15 22:41:30,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-11-15 22:41:30,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-15 22:41:30,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-15 22:41:30,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-11-15 22:41:30,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:30,147 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-11-15 22:41:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-11-15 22:41:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-11-15 22:41:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 22:41:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-11-15 22:41:30,154 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-15 22:41:30,154 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-15 22:41:30,154 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:41:30,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-11-15 22:41:30,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-15 22:41:30,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:30,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:30,156 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:41:30,156 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:30,157 INFO L791 eck$LassoCheckResult]: Stem: 2504#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; 2505#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; 2447#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2448#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2475#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-11-15 22:41:30,157 INFO L793 eck$LassoCheckResult]: Loop: 2483#L25 assume !(main_~j~0 < main_~r~0); 2478#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; 2479#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2471#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; 2465#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2466#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; 2495#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2491#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; 2487#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2488#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; 2508#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2502#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; 2463#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2457#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2458#L24-2 assume !!(main_~j~0 <= main_~r~0); 2483#L25 [2019-11-15 22:41:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-11-15 22:41:30,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:30,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616666031] [2019-11-15 22:41:30,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:30,190 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-11-15 22:41:30,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:30,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003197757] [2019-11-15 22:41:30,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:30,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003197757] [2019-11-15 22:41:30,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:30,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:41:30,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664921790] [2019-11-15 22:41:30,323 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:41:30,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:30,323 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-11-15 22:41:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:30,508 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2019-11-15 22:41:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:41:30,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 254 transitions. [2019-11-15 22:41:30,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-15 22:41:30,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 240 transitions. [2019-11-15 22:41:30,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 22:41:30,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 22:41:30,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 240 transitions. [2019-11-15 22:41:30,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:30,513 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 240 transitions. [2019-11-15 22:41:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 240 transitions. [2019-11-15 22:41:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 163. [2019-11-15 22:41:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:41:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-11-15 22:41:30,521 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-15 22:41:30,521 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-15 22:41:30,521 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:41:30,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-11-15 22:41:30,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-15 22:41:30,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:30,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:30,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:41:30,524 INFO L850 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] [2019-11-15 22:41:30,524 INFO L791 eck$LassoCheckResult]: Stem: 2870#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; 2871#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; 2811#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 2812#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2839#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-11-15 22:41:30,532 INFO L793 eck$LassoCheckResult]: Loop: 2848#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; 2849#L4 assume !(0 == __VERIFIER_assert_~cond); 2879#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; 2875#L4-3 assume !(0 == __VERIFIER_assert_~cond); 2866#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; 2825#L4-6 assume !(0 == __VERIFIER_assert_~cond); 2819#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; 2813#L4-9 assume !(0 == __VERIFIER_assert_~cond); 2814#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 2842#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; 2843#L4-12 assume !(0 == __VERIFIER_assert_~cond); 2835#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; 2829#L4-15 assume !(0 == __VERIFIER_assert_~cond); 2830#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; 2861#L4-18 assume !(0 == __VERIFIER_assert_~cond); 2857#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; 2853#L4-21 assume !(0 == __VERIFIER_assert_~cond); 2854#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; 2877#L4-24 assume !(0 == __VERIFIER_assert_~cond); 2868#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; 2827#L4-27 assume !(0 == __VERIFIER_assert_~cond); 2821#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2822#L24-2 assume !!(main_~j~0 <= main_~r~0); 2848#L25 [2019-11-15 22:41:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-11-15 22:41:30,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:30,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758113506] [2019-11-15 22:41:30,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:30,547 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-11-15 22:41:30,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:30,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313508575] [2019-11-15 22:41:30,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:30,592 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-11-15 22:41:30,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:30,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209494460] [2019-11-15 22:41:30,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:30,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:30,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209494460] [2019-11-15 22:41:30,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872521250] [2019-11-15 22:41:30,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:30,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:41:30,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:30,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:30,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:30,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:41:30,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-15 22:41:30,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925174844] [2019-11-15 22:41:31,199 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-15 22:41:31,200 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-15 22:41:32,038 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-11-15 22:41:32,039 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:32,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:32,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:32,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:32,040 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:41:32,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:32,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:32,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:32,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-15 22:41:32,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:32,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:32,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,136 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:32,136 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:32,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:32,150 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:32,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:41:32,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:41:32,318 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:41:32,320 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:32,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:32,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:32,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:32,321 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:32,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:32,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:32,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:32,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-15 22:41:32,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:32,321 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:32,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:32,432 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:32,433 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:32,433 INFO L120 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 [2019-11-15 22:41:32,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:32,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:32,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:32,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:32,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:32,435 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:32,435 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:32,438 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:32,453 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:41:32,456 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:41:32,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:32,456 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:41:32,457 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:32,457 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -4*ULTIMATE.start_main_~j~0 + 5*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:41:32,457 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:41:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:32,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:32,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:32,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:41:32,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:32,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 22:41:32,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-15 22:41:32,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 638 states and 696 transitions. Complement of second has 17 states. [2019-11-15 22:41:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-15 22:41:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:41:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2019-11-15 22:41:32,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 78 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-15 22:41:32,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:32,978 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:41:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:33,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:33,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:33,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:41:33,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:33,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:33,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:33,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 22:41:33,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-15 22:41:33,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 724 states and 790 transitions. Complement of second has 27 states. [2019-11-15 22:41:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-15 22:41:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:41:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2019-11-15 22:41:33,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-15 22:41:33,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:33,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 28 letters. Loop has 23 letters. [2019-11-15 22:41:33,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:33,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 46 letters. [2019-11-15 22:41:33,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:33,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 790 transitions. [2019-11-15 22:41:33,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-15 22:41:33,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 581 states and 644 transitions. [2019-11-15 22:41:33,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-15 22:41:33,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-15 22:41:33,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 644 transitions. [2019-11-15 22:41:33,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:33,676 INFO L688 BuchiCegarLoop]: Abstraction has 581 states and 644 transitions. [2019-11-15 22:41:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 644 transitions. [2019-11-15 22:41:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 409. [2019-11-15 22:41:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-15 22:41:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-11-15 22:41:33,685 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-11-15 22:41:33,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:33,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:41:33,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:41:33,686 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 7 states. [2019-11-15 22:41:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:34,070 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-11-15 22:41:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:41:34,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-11-15 22:41:34,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-15 22:41:34,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-11-15 22:41:34,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 22:41:34,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 22:41:34,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-11-15 22:41:34,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:34,078 INFO L688 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-11-15 22:41:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-11-15 22:41:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-11-15 22:41:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 22:41:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-11-15 22:41:34,082 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-15 22:41:34,082 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-15 22:41:34,083 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:41:34,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-11-15 22:41:34,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-15 22:41:34,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:34,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:34,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:34,085 INFO L850 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] [2019-11-15 22:41:34,085 INFO L791 eck$LassoCheckResult]: Stem: 5774#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; 5775#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; 5713#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 5714#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5743#L24-2 assume !!(main_~j~0 <= main_~r~0); 5859#L25 assume !(main_~j~0 < main_~r~0); 5858#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; 5917#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5916#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; 5734#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5735#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 5768#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; 5719#L4-30 assume !(0 == __VERIFIER_assert_~cond); 5720#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; 5750#L4-33 assume !(0 == __VERIFIER_assert_~cond); 5751#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 5790#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5724#L24-2 [2019-11-15 22:41:34,085 INFO L793 eck$LassoCheckResult]: Loop: 5724#L24-2 assume !!(main_~j~0 <= main_~r~0); 5752#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; 5753#L4 assume !(0 == __VERIFIER_assert_~cond); 5784#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; 5778#L4-3 assume !(0 == __VERIFIER_assert_~cond); 5769#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; 5727#L4-6 assume !(0 == __VERIFIER_assert_~cond); 5721#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; 5715#L4-9 assume !(0 == __VERIFIER_assert_~cond); 5716#L4-11 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 1 + main_~j~0; 5746#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; 5747#L4-12 assume !(0 == __VERIFIER_assert_~cond); 5738#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; 5732#L4-15 assume !(0 == __VERIFIER_assert_~cond); 5733#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; 5765#L4-18 assume !(0 == __VERIFIER_assert_~cond); 5761#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; 5757#L4-21 assume !(0 == __VERIFIER_assert_~cond); 5758#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; 5781#L4-24 assume !(0 == __VERIFIER_assert_~cond); 5772#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; 5730#L4-27 assume !(0 == __VERIFIER_assert_~cond); 5723#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5724#L24-2 [2019-11-15 22:41:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-11-15 22:41:34,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:34,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826573345] [2019-11-15 22:41:34,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:34,101 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-11-15 22:41:34,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:34,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131701934] [2019-11-15 22:41:34,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:34,118 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-11-15 22:41:34,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:34,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846078725] [2019-11-15 22:41:34,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:34,170 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:34,347 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-15 22:41:34,348 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-15 22:41:34,885 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-11-15 22:41:34,887 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:34,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:34,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:34,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:34,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:41:34,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:34,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:34,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:34,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-15 22:41:34,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:34,888 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:34,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:34,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:34,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:34,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:34,986 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:34,986 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:41:35,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:41:35,002 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17fc9c75-6d4a-46d0-ac0f-73adcb42ea38/bin/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 [2019-11-15 22:41:35,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:41:35,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:41:35,151 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:41:35,154 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:35,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:35,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:35,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:35,154 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:35,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:35,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:35,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:35,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-15 22:41:35,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:35,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:35,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:35,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:35,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:35,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:35,262 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:35,263 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:35,263 INFO L120 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 [2019-11-15 22:41:35,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:35,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:35,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:35,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:35,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:35,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:35,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:35,267 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:35,280 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:41:35,280 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:41:35,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:35,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:41:35,286 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:35,286 INFO L512 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 [] [2019-11-15 22:41:35,286 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:41:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:35,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:35,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:35,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:41:35,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:35,422 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 [2019-11-15 22:41:35,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-11-15 22:41:35,592 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. [2019-11-15 22:41:35,593 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 [2019-11-15 22:41:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:41:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2019-11-15 22:41:35,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-15 22:41:35,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:35,594 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:41:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:35,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:35,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:35,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:41:35,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:35,703 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 [2019-11-15 22:41:35,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-11-15 22:41:35,862 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. [2019-11-15 22:41:35,864 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 [2019-11-15 22:41:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:41:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2019-11-15 22:41:35,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-15 22:41:35,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:35,865 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:41:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:35,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:35,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:35,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:41:35,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:35,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:36,014 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 [2019-11-15 22:41:36,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-11-15 22:41:36,171 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. [2019-11-15 22:41:36,171 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 [2019-11-15 22:41:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:41:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2019-11-15 22:41:36,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 104 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-15 22:41:36,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:36,172 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:41:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:36,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:36,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:36,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:41:36,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:36,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:36,309 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 [2019-11-15 22:41:36,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-11-15 22:41:36,523 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. [2019-11-15 22:41:36,523 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 [2019-11-15 22:41:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:41:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2019-11-15 22:41:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-15 22:41:36,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 40 letters. Loop has 23 letters. [2019-11-15 22:41:36,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:36,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 115 transitions. Stem has 17 letters. Loop has 46 letters. [2019-11-15 22:41:36,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:36,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 769 transitions. [2019-11-15 22:41:36,530 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:41:36,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 0 states and 0 transitions. [2019-11-15 22:41:36,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:41:36,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:41:36,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:41:36,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:41:36,531 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:41:36,531 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:41:36,531 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:41:36,532 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 22:41:36,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:41:36,532 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:41:36,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:41:36,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:41:36 BoogieIcfgContainer [2019-11-15 22:41:36,541 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:41:36,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:41:36,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:41:36,541 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:41:36,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:41:24" (3/4) ... [2019-11-15 22:41:36,545 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:41:36,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:41:36,551 INFO L168 Benchmark]: Toolchain (without parser) took 12831.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -143.1 MB). Peak memory consumption was 78.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:36,552 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:41:36,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:36,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:41:36,554 INFO L168 Benchmark]: Boogie Preprocessor took 28.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:36,556 INFO L168 Benchmark]: RCFGBuilder took 431.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:36,559 INFO L168 Benchmark]: BuchiAutomizer took 11865.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:36,559 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:41:36,563 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 443.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 431.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11865.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.3 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 -4 * j + 5 * n and consists of 14 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 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 7.2s. Construction of modules took 1.7s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 800 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 [4, 1, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 819 SDtfs, 1416 SDslu, 950 SDs, 0 SdLazy, 1358 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s 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 eq155 hnf93 smp97 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...