./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-678e011 [2019-11-20 02:57:31,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:57:31,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:57:31,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:57:31,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:57:31,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:57:31,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:57:31,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:57:31,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:57:31,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:57:31,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:57:31,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:57:31,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:57:31,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:57:31,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:57:31,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:57:31,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:57:31,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:57:31,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:57:31,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:57:31,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:57:31,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:57:31,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:57:31,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:57:31,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:57:31,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:57:31,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:57:31,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:57:31,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:57:31,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:57:31,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:57:31,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:57:31,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:57:31,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:57:31,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:57:31,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:57:31,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:57:31,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:57:31,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:57:31,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:57:31,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:57:31,587 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 02:57:31,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:57:31,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:57:31,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:57:31,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:57:31,620 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:57:31,621 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 02:57:31,621 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 02:57:31,621 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 02:57:31,621 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 02:57:31,621 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 02:57:31,622 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 02:57:31,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:57:31,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:57:31,622 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 02:57:31,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:57:31,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:57:31,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:57:31,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 02:57:31,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 02:57:31,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 02:57:31,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:57:31,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:57:31,624 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 02:57:31,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:57:31,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 02:57:31,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:57:31,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:57:31,625 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 02:57:31,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:57:31,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:57:31,625 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 02:57:31,626 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 02:57:31,626 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_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:31,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:57:31,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:57:31,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:57:31,813 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:57:31,813 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:57:31,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-20 02:57:31,863 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/data/6ed62ce9e/9fa5e784ac224f1698cc28759a1d3724/FLAGd010cce3e [2019-11-20 02:57:32,281 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:57:32,282 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-20 02:57:32,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/data/6ed62ce9e/9fa5e784ac224f1698cc28759a1d3724/FLAGd010cce3e [2019-11-20 02:57:32,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/data/6ed62ce9e/9fa5e784ac224f1698cc28759a1d3724 [2019-11-20 02:57:32,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:57:32,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:57:32,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:57:32,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:57:32,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:57:32,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7edf95a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32, skipping insertion in model container [2019-11-20 02:57:32,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,315 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:57:32,332 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:57:32,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:57:32,466 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:57:32,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:57:32,565 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:57:32,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32 WrapperNode [2019-11-20 02:57:32,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:57:32,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:57:32,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:57:32,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:57:32,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:57:32,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:57:32,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:57:32,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:57:32,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... [2019-11-20 02:57:32,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:57:32,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:57:32,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:57:32,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:57:32,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:32,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:57:32,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:57:33,034 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:57:33,034 INFO L285 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-20 02:57:33,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:57:33 BoogieIcfgContainer [2019-11-20 02:57:33,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:57:33,036 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 02:57:33,036 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 02:57:33,040 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 02:57:33,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:57:33,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 02:57:32" (1/3) ... [2019-11-20 02:57:33,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ee56f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:57:33, skipping insertion in model container [2019-11-20 02:57:33,042 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:57:33,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:32" (2/3) ... [2019-11-20 02:57:33,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ee56f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:57:33, skipping insertion in model container [2019-11-20 02:57:33,043 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:57:33,043 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:57:33" (3/3) ... [2019-11-20 02:57:33,044 INFO L371 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2019-11-20 02:57:33,093 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 02:57:33,093 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 02:57:33,093 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 02:57:33,093 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:57:33,094 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:57:33,094 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 02:57:33,094 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:57:33,094 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 02:57:33,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-20 02:57:33,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-20 02:57:33,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:33,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:33,155 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:57:33,156 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:33,156 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 02:57:33,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-20 02:57:33,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-20 02:57:33,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:33,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:33,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:57:33,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:33,173 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 55#L13true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 31#L16true assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 40#L45-1true [2019-11-20 02:57:33,173 INFO L796 eck$LassoCheckResult]: Loop: 40#L45-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 53#L24-2true assume !true; 52#L24-3true assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 32#L4-30true assume !(0 == __VERIFIER_assert_~cond); 44#L4-32true __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 42#L4-33true assume !(0 == __VERIFIER_assert_~cond); 39#L4-35true main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 40#L45-1true [2019-11-20 02:57:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:33,180 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-11-20 02:57:33,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:33,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108168613] [2019-11-20 02:57:33,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,288 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-11-20 02:57:33,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:33,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182528545] [2019-11-20 02:57:33,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:33,314 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-20 02:57:33,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182528545] [2019-11-20 02:57:33,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:33,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:57:33,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506862409] [2019-11-20 02:57:33,320 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:57:33,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 02:57:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:57:33,335 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-11-20 02:57:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:33,344 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-20 02:57:33,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 02:57:33,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-11-20 02:57:33,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-20 02:57:33,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-11-20 02:57:33,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-20 02:57:33,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-20 02:57:33,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-11-20 02:57:33,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:57:33,356 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-20 02:57:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-11-20 02:57:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-20 02:57:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 02:57:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-20 02:57:33,383 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-20 02:57:33,383 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-20 02:57:33,383 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 02:57:33,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-20 02:57:33,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-20 02:57:33,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:33,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:33,385 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:57:33,385 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:33,386 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 116#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 117#L45-1 [2019-11-20 02:57:33,386 INFO L796 eck$LassoCheckResult]: Loop: 117#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 124#L24-2 assume !(main_~j~0 <= main_~r~0); 144#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 129#L4-36 assume !(0 == __VERIFIER_assert_~cond); 130#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 143#L4-39 assume !(0 == __VERIFIER_assert_~cond); 141#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 117#L45-1 [2019-11-20 02:57:33,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:33,386 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-11-20 02:57:33,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:33,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092864516] [2019-11-20 02:57:33,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:33,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-11-20 02:57:33,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:33,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509616641] [2019-11-20 02:57:33,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:33,451 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-20 02:57:33,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509616641] [2019-11-20 02:57:33,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:33,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:57:33,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661590285] [2019-11-20 02:57:33,452 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:57:33,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:33,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:57:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:57:33,453 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-20 02:57:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:33,609 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-11-20 02:57:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:57:33,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-11-20 02:57:33,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-20 02:57:33,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-11-20 02:57:33,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-20 02:57:33,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-11-20 02:57:33,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-11-20 02:57:33,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:57:33,617 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-11-20 02:57:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-11-20 02:57:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-11-20 02:57:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 02:57:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-20 02:57:33,622 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-20 02:57:33,622 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-20 02:57:33,622 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 02:57:33,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-11-20 02:57:33,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-20 02:57:33,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:33,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:33,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:57:33,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:33,625 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 264#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 230#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 231#L45-1 [2019-11-20 02:57:33,625 INFO L796 eck$LassoCheckResult]: Loop: 231#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 247#L24-2 assume !(main_~j~0 <= main_~r~0); 262#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 234#L4-30 assume !(0 == __VERIFIER_assert_~cond); 235#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 250#L4-33 assume !(0 == __VERIFIER_assert_~cond); 246#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 231#L45-1 [2019-11-20 02:57:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-11-20 02:57:33,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:33,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63393682] [2019-11-20 02:57:33,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:33,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-11-20 02:57:33,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:33,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403630009] [2019-11-20 02:57:33,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:33,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-11-20 02:57:33,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:33,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472475138] [2019-11-20 02:57:33,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:33,699 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-20 02:57:33,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472475138] [2019-11-20 02:57:33,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:33,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:57:33,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503786648] [2019-11-20 02:57:33,862 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:33,863 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:33,863 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:33,864 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:33,864 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:57:33,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:33,864 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:33,864 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:33,865 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-20 02:57:33,865 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:33,865 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:33,887 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-20 02:57:33,920 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-20 02:57:33,924 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-20 02:57:34,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:34,018 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:34,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:34,030 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:34,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:57:34,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:57:34,313 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:57:34,315 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:34,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:34,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:34,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:34,316 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:57:34,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:34,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:34,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:34,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-20 02:57:34,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:34,316 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:34,318 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-20 02:57:34,325 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-20 02:57:34,334 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-20 02:57:34,433 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:34,438 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:34,454 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-20 02:57:34,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:34,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:34,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:34,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:34,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:34,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:34,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:34,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:34,474 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-20 02:57:34,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:34,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:34,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:34,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:34,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:34,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:34,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:34,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:34,504 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-20 02:57:34,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:34,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:34,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:34,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:34,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:34,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:34,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:34,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:57:34,541 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 02:57:34,541 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:34,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:57:34,563 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:57:34,563 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:57:34,564 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-20 02:57:34,569 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:57:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:34,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:34,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:34,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:57:34,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:34,669 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-20 02:57:34,673 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-20 02:57:34,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-20 02:57:34,748 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-20 02:57:34,751 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-20 02:57:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:57:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-11-20 02:57:34,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-20 02:57:34,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:34,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-20 02:57:34,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:34,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-20 02:57:34,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:34,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-11-20 02:57:34,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-11-20 02:57:34,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-11-20 02:57:34,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-20 02:57:34,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-11-20 02:57:34,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-11-20 02:57:34,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:34,783 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-11-20 02:57:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-11-20 02:57:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-20 02:57:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-20 02:57:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-20 02:57:34,798 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-20 02:57:34,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:57:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:57:34,800 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-11-20 02:57:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:34,828 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-11-20 02:57:34,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:57:34,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-11-20 02:57:34,836 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-11-20 02:57:34,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-11-20 02:57:34,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-20 02:57:34,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-20 02:57:34,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-11-20 02:57:34,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:57:34,839 INFO L688 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-11-20 02:57:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-11-20 02:57:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-11-20 02:57:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 02:57:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-20 02:57:34,857 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-20 02:57:34,857 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-20 02:57:34,857 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 02:57:34,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-20 02:57:34,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-11-20 02:57:34,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:34,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:34,859 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:57:34,859 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:34,859 INFO L794 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 699#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 665#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 666#L45-1 [2019-11-20 02:57:34,859 INFO L796 eck$LassoCheckResult]: Loop: 666#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 705#L24-2 assume !(main_~j~0 <= main_~r~0); 703#L24-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 670#L4-30 assume !(0 == __VERIFIER_assert_~cond); 671#L4-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 686#L4-33 assume !(0 == __VERIFIER_assert_~cond); 682#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 666#L45-1 [2019-11-20 02:57:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-11-20 02:57:34,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:34,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574249045] [2019-11-20 02:57:34,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:34,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-11-20 02:57:34,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:34,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275906018] [2019-11-20 02:57:34,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:34,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-11-20 02:57:34,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:34,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541697533] [2019-11-20 02:57:34,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:34,980 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-20 02:57:34,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541697533] [2019-11-20 02:57:34,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:34,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:57:34,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452370572] [2019-11-20 02:57:35,148 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:35,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:35,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:35,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:35,148 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:57:35,148 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:35,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:35,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:35,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-20 02:57:35,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:35,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:35,150 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-20 02:57:35,154 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-20 02:57: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-20 02:57:35,263 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:35,263 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:35,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:35,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:57:35,281 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:57:35,281 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_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:35,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:35,297 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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) [2019-11-20 02:57:35,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:57:35,322 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:35,694 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:57:35,697 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:35,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:35,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:35,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:35,698 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:57:35,698 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:35,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:35,698 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:35,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-20 02:57:35,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:35,699 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:35,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-20 02:57:35,719 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-20 02:57:35,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-20 02:57:35,820 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:35,820 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:35,824 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-20 02:57:35,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:35,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:35,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:35,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:35,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:35,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:35,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:35,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:35,841 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-20 02:57:35,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:35,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:35,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:35,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:35,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:35,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:35,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:35,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:57:35,872 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 02:57:35,872 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:57:35,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:57:35,898 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:57:35,898 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:57:35,898 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:35,906 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:57:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:35,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:35,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:35,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:57:35,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:35,954 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-20 02:57:35,954 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-20 02:57:35,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-11-20 02:57:35,980 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-20 02:57:35,981 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-20 02:57:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:57:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-11-20 02:57:35,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-20 02:57:35,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:35,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-20 02:57:35,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:35,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-20 02:57:35,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:35,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-11-20 02:57:35,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-11-20 02:57:35,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-11-20 02:57:35,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-20 02:57:35,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-11-20 02:57:35,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-11-20 02:57:35,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:35,988 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-20 02:57:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-11-20 02:57:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-11-20 02:57:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 02:57:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-20 02:57:35,993 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-20 02:57:35,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:57:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:57:35,994 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-11-20 02:57:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:36,158 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-11-20 02:57:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:57:36,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-11-20 02:57:36,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-11-20 02:57:36,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-11-20 02:57:36,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-20 02:57:36,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-11-20 02:57:36,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-11-20 02:57:36,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:36,166 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-11-20 02:57:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-11-20 02:57:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-11-20 02:57:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 02:57:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-20 02:57:36,173 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-20 02:57:36,173 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-20 02:57:36,173 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 02:57:36,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-20 02:57:36,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-20 02:57:36,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:36,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:36,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:57:36,176 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:36,176 INFO L794 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet1, main_#t~post2, main_#t~post3, main_#t~nondet4, main_#t~nondet5, main_#t~post6, main_#t~post7, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L13 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1203#L16 assume !(main_~l~0 > 1);main_#t~post3 := main_~r~0;main_~r~0 := main_#t~post3 - 1;havoc main_#t~post3; 1205#L45-1 [2019-11-20 02:57:36,176 INFO L796 eck$LassoCheckResult]: Loop: 1205#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1232#L24-2 assume !!(main_~j~0 <= main_~r~0); 1239#L25 assume !(main_~j~0 < main_~r~0); 1236#L25-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1234#L4-12 assume !(0 == __VERIFIER_assert_~cond); 1228#L4-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1222#L4-15 assume !(0 == __VERIFIER_assert_~cond); 1223#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 1253#L24-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1226#L4-36 assume !(0 == __VERIFIER_assert_~cond); 1227#L4-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1252#L4-39 assume !(0 == __VERIFIER_assert_~cond); 1249#L4-41 main_#t~post7 := main_~r~0;main_~r~0 := main_#t~post7 - 1;havoc main_#t~post7; 1205#L45-1 [2019-11-20 02:57:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:36,177 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-11-20 02:57:36,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:36,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647416794] [2019-11-20 02:57:36,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:36,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:36,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:36,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-11-20 02:57:36,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:36,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124343215] [2019-11-20 02:57:36,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:36,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-11-20 02:57:36,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:36,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261562416] [2019-11-20 02:57:36,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:36,317 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-20 02:57:36,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261562416] [2019-11-20 02:57:36,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:36,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:57:36,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194598817] [2019-11-20 02:57:36,423 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-20 02:57:36,631 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-11-20 02:57:36,633 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:36,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:36,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:36,633 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:36,633 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:57:36,633 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:36,633 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:36,633 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:36,634 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-20 02:57:36,634 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:36,634 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:36,635 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-20 02:57:36,649 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-20 02:57:36,652 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-20 02:57:36,663 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-20 02:57:36,758 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:36,758 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:36,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:36,773 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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) [2019-11-20 02:57:36,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:57:36,793 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:36,813 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:57:36,815 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:36,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:36,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:36,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:36,815 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:57:36,815 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:36,815 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:36,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:36,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-20 02:57:36,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:36,816 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:36,817 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-20 02:57:36,837 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-20 02:57:36,839 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-20 02:57:36,840 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-20 02:57:36,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:36,935 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:36,941 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-20 02:57:36,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:36,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:36,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:36,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:36,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:36,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:36,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:36,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:57:36,951 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-20 02:57:36,951 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/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-20 02:57:36,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:57:36,954 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:57:36,954 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:57:36,954 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-20 02:57:36,956 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:57:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:36,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:36,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:36,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:57:36,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:36,997 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-20 02:57:36,997 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-20 02:57:36,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-20 02:57:37,042 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-20 02:57:37,042 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-20 02:57:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 02:57:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-11-20 02:57:37,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-11-20 02:57:37,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:37,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-11-20 02:57:37,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:37,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-11-20 02:57:37,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:37,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-11-20 02:57:37,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-20 02:57:37,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-11-20 02:57:37,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-20 02:57:37,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-20 02:57:37,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-11-20 02:57:37,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:37,047 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-11-20 02:57:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-11-20 02:57:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-11-20 02:57:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-20 02:57:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-11-20 02:57:37,051 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-11-20 02:57:37,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:57:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:57:37,052 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 4 states. [2019-11-20 02:57:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:37,093 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-20 02:57:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:57:37,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 75 transitions. [2019-11-20 02:57:37,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-20 02:57:37,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 74 transitions. [2019-11-20 02:57:37,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-20 02:57:37,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-20 02:57:37,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-11-20 02:57:37,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:37,095 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-20 02:57:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-11-20 02:57:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-20 02:57:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 02:57:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-20 02:57:37,097 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-20 02:57:37,097 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-20 02:57:37,097 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 02:57:37,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-11-20 02:57:37,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-20 02:57:37,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:37,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:37,099 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:57:37,099 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:37,099 INFO L794 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-20 02:57:37,099 INFO L796 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-20 02:57:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-11-20 02:57:37,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:37,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774209138] [2019-11-20 02:57:37,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:37,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-11-20 02:57:37,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:37,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787049447] [2019-11-20 02:57:37,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:37,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-11-20 02:57:37,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:37,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788103406] [2019-11-20 02:57:37,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:37,194 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-20 02:57:37,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788103406] [2019-11-20 02:57:37,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:37,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:57:37,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945694624] [2019-11-20 02:57:37,411 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-11-20 02:57:37,412 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:37,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:37,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:37,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:37,413 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:57:37,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:37,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:37,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:37,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-20 02:57:37,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:37,413 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:37,414 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-20 02:57:37,417 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-20 02:57:37,419 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-20 02:57:37,434 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-20 02:57:37,530 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:37,531 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:37,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:37,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:57:37,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:57:37,549 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_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:37,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:37,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:57:37,559 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:57:37,559 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_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:37,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:37,564 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:37,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:57:37,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:57:37,901 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:57:37,904 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:37,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:37,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:37,904 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:37,904 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:57:37,904 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:37,904 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:37,904 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:37,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-20 02:57:37,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:37,905 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:37,906 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-20 02:57:37,923 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-20 02:57:37,928 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-20 02:57:37,930 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-20 02:57:38,005 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:38,005 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:38,013 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-20 02:57:38,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:38,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:38,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:38,015 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-20 02:57:38,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:38,016 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-20 02:57:38,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:38,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:38,023 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-20 02:57:38,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:38,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:38,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:38,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:38,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:38,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:38,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:38,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:38,031 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-20 02:57:38,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:38,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:38,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:38,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:38,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:38,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:38,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:38,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:38,039 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-20 02:57:38,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:38,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:38,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:38,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:38,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:38,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:38,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:38,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:57:38,058 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 02:57:38,059 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:57:38,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:57:38,066 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:57:38,066 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:57:38,066 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-20 02:57:38,076 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:38,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:38,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:38,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:57:38,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:38,132 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-20 02:57:38,133 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-20 02:57:38,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-20 02:57:38,189 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-20 02:57:38,190 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-20 02:57:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:57:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-11-20 02:57:38,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-11-20 02:57:38,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:38,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-11-20 02:57:38,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:38,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-11-20 02:57:38,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:38,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-11-20 02:57:38,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:38,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-11-20 02:57:38,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 02:57:38,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-20 02:57:38,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-11-20 02:57:38,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:38,196 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-11-20 02:57:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-11-20 02:57:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-20 02:57:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 02:57:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-11-20 02:57:38,200 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-20 02:57:38,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:38,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:57:38,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:57:38,206 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-11-20 02:57:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:38,388 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-11-20 02:57:38,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:57:38,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-11-20 02:57:38,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-20 02:57:38,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-11-20 02:57:38,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-20 02:57:38,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-20 02:57:38,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-11-20 02:57:38,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:38,404 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-11-20 02:57:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-11-20 02:57:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-11-20 02:57:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-20 02:57:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-11-20 02:57:38,413 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-20 02:57:38,413 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-20 02:57:38,414 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 02:57:38,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-11-20 02:57:38,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:38,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:38,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:38,415 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 02:57:38,415 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:38,415 INFO L794 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-20 02:57:38,415 INFO L796 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-20 02:57:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-11-20 02:57:38,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:38,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852349170] [2019-11-20 02:57:38,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:38,426 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:38,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-11-20 02:57:38,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:38,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644213716] [2019-11-20 02:57:38,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:38,495 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-20 02:57:38,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644213716] [2019-11-20 02:57:38,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:57:38,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:57:38,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834395920] [2019-11-20 02:57:38,496 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:57:38,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:57:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:57:38,497 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-11-20 02:57:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:38,669 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2019-11-20 02:57:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:57:38,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 254 transitions. [2019-11-20 02:57:38,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:38,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 240 transitions. [2019-11-20 02:57:38,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-20 02:57:38,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-20 02:57:38,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 240 transitions. [2019-11-20 02:57:38,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:38,674 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 240 transitions. [2019-11-20 02:57:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 240 transitions. [2019-11-20 02:57:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 163. [2019-11-20 02:57:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 02:57:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-11-20 02:57:38,678 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-20 02:57:38,678 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-20 02:57:38,678 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 02:57:38,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-11-20 02:57:38,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:38,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:38,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:38,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 02:57:38,680 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-20 02:57:38,680 INFO L794 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-20 02:57:38,680 INFO L796 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-20 02:57:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-11-20 02:57:38,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:38,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620635125] [2019-11-20 02:57:38,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:38,704 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-11-20 02:57:38,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:38,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811730392] [2019-11-20 02:57:38,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:38,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:38,746 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-11-20 02:57:38,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:38,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25759365] [2019-11-20 02:57:38,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:38,825 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-20 02:57:38,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25759365] [2019-11-20 02:57:38,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042582568] [2019-11-20 02:57:38,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:57:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:38,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 02:57:38,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:38,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:38,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:39,094 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-20 02:57:39,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:57:39,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-20 02:57:39,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162680284] [2019-11-20 02:57:39,364 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-20 02:57:39,366 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-20 02:57:40,212 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-11-20 02:57:40,213 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:40,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:40,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:40,214 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:40,214 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:57:40,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:40,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:40,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:40,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-20 02:57:40,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:40,214 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:40,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:57:40,232 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-20 02:57:40,234 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-20 02:57:40,240 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-20 02:57:40,319 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:40,319 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:40,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:40,323 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:40,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:57:40,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:57:40,447 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:57:40,448 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:40,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:40,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:40,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:40,449 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:57:40,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:40,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:40,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:40,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-20 02:57:40,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:40,449 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:40,450 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-20 02:57:40,463 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-20 02:57:40,465 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-20 02:57:40,469 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-20 02:57:40,542 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:40,543 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:40,546 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-20 02:57:40,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:40,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:40,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:40,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:40,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:40,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:40,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:40,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:57:40,557 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 02:57:40,557 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:40,560 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:57:40,560 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:57:40,560 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:57:40,561 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-20 02:57:40,563 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:57:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:40,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:40,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:40,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:57:40,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:40,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:40,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:40,776 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-20 02:57:40,777 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-20 02:57:40,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-20 02:57:41,052 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-20 02:57:41,052 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-20 02:57:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 02:57:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2019-11-20 02:57:41,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 78 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-20 02:57:41,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:41,054 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:57:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:41,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:41,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:41,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:57:41,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:41,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:41,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:41,247 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-20 02:57:41,247 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-20 02:57:41,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-20 02:57:41,749 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-20 02:57:41,750 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-20 02:57:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 02:57:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2019-11-20 02:57:41,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-20 02:57:41,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:41,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 28 letters. Loop has 23 letters. [2019-11-20 02:57:41,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:41,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 46 letters. [2019-11-20 02:57:41,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:41,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 790 transitions. [2019-11-20 02:57:41,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-20 02:57:41,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 581 states and 644 transitions. [2019-11-20 02:57:41,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-20 02:57:41,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-20 02:57:41,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 644 transitions. [2019-11-20 02:57:41,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:41,775 INFO L688 BuchiCegarLoop]: Abstraction has 581 states and 644 transitions. [2019-11-20 02:57:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 644 transitions. [2019-11-20 02:57:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 409. [2019-11-20 02:57:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-20 02:57:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-11-20 02:57:41,785 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-11-20 02:57:41,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:57:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:57:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:57:41,786 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 7 states. [2019-11-20 02:57:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:57:42,205 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-11-20 02:57:42,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:57:42,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-11-20 02:57:42,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:42,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-11-20 02:57:42,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 02:57:42,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-20 02:57:42,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-11-20 02:57:42,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:42,217 INFO L688 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-11-20 02:57:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-11-20 02:57:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-11-20 02:57:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-20 02:57:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-11-20 02:57:42,224 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-20 02:57:42,224 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-20 02:57:42,224 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 02:57:42,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-11-20 02:57:42,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:42,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:42,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:42,228 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:42,228 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-20 02:57:42,229 INFO L794 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-20 02:57:42,229 INFO L796 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-20 02:57:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-11-20 02:57:42,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:42,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969422584] [2019-11-20 02:57:42,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:42,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-11-20 02:57:42,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:42,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819458239] [2019-11-20 02:57:42,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:42,306 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:42,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-11-20 02:57:42,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:42,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5871335] [2019-11-20 02:57:42,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:42,352 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:42,528 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-20 02:57:42,529 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-20 02:57:43,022 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-11-20 02:57:43,022 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:43,023 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:43,023 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:43,023 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:43,023 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:57:43,023 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:43,023 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:43,023 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:43,023 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-20 02:57:43,023 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:43,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:43,024 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-20 02:57:43,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-20 02:57:43,045 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-20 02:57:43,047 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-20 02:57:43,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:43,105 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:43,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:43,115 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:43,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:57:43,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:57:43,223 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:57:43,224 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:43,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:43,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:43,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:43,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:57:43,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:43,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:43,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:43,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-20 02:57:43,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:43,225 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:43,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-20 02:57:43,237 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-20 02:57:43,240 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-20 02:57:43,246 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-20 02:57:43,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:43,305 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:43,310 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-20 02:57:43,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:43,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:43,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:43,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:43,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:43,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:43,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:43,316 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:57:43,320 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 02:57:43,320 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:43,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:57:43,323 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:57:43,324 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:57:43,324 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-20 02:57:43,325 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:57:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:43,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:43,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:43,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:57:43,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:43,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:43,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:43,440 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-20 02:57:43,441 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-20 02:57:43,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-20 02:57:43,691 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 384 states and 424 transitions. Complement of second has 17 states. [2019-11-20 02:57:43,692 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-20 02:57:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 02:57:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2019-11-20 02:57:43,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 61 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-20 02:57:43,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:43,693 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:57:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:43,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:43,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:43,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:57:43,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:43,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:43,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:43,816 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-20 02:57:43,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-20 02:57:43,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-20 02:57:44,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 460 states and 504 transitions. Complement of second has 25 states. [2019-11-20 02:57:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-20 02:57:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 02:57:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2019-11-20 02:57:44,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 80 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-20 02:57:44,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:44,148 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:57:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:44,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:44,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:44,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:57:44,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:44,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:44,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:44,272 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-20 02:57:44,272 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 6 loop predicates [2019-11-20 02:57:44,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-20 02:57:44,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 804 states and 878 transitions. Complement of second has 16 states. [2019-11-20 02:57:44,563 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-20 02:57:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 02:57:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2019-11-20 02:57:44,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 114 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-20 02:57:44,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:44,564 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:57:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:44,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:44,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:44,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:57:44,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:44,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:44,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:44,717 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-20 02:57:44,718 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 6 loop predicates [2019-11-20 02:57:44,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-20 02:57:45,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32. Second operand 8 states. Result 777 states and 851 transitions. Complement of second has 24 states. [2019-11-20 02:57:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-11-20 02:57:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 02:57:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2019-11-20 02:57:45,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-20 02:57:45,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:45,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 40 letters. Loop has 23 letters. [2019-11-20 02:57:45,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:45,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 46 letters. [2019-11-20 02:57:45,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:45,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 851 transitions. [2019-11-20 02:57:45,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:45,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 546 states and 604 transitions. [2019-11-20 02:57:45,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 02:57:45,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-20 02:57:45,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 604 transitions. [2019-11-20 02:57:45,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:57:45,136 INFO L688 BuchiCegarLoop]: Abstraction has 546 states and 604 transitions. [2019-11-20 02:57:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 604 transitions. [2019-11-20 02:57:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 403. [2019-11-20 02:57:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-20 02:57:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 449 transitions. [2019-11-20 02:57:45,145 INFO L711 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-20 02:57:45,146 INFO L591 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-20 02:57:45,146 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 02:57:45,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 449 transitions. [2019-11-20 02:57:45,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-20 02:57:45,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:57:45,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:57:45,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:57:45,153 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-20 02:57:45,153 INFO L794 eck$LassoCheckResult]: Stem: 9056#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; 9057#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; 8991#L16 assume main_~l~0 > 1;main_#t~post2 := main_~l~0;main_~l~0 := main_#t~post2 - 1;havoc main_#t~post2; 8992#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 9021#L24-2 assume !!(main_~j~0 <= main_~r~0); 9253#L25 assume !(main_~j~0 < main_~r~0); 9035#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; 9393#L4-12 assume !(0 == __VERIFIER_assert_~cond); 9392#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; 9391#L4-15 assume !(0 == __VERIFIER_assert_~cond); 9390#L4-17 assume 0 != main_#t~nondet5;havoc main_#t~nondet5; 9054#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; 9055#L4-30 assume !(0 == __VERIFIER_assert_~cond); 9036#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; 9029#L4-33 assume !(0 == __VERIFIER_assert_~cond); 9019#L4-35 main_#t~post6 := main_~l~0;main_~l~0 := main_#t~post6 - 1;havoc main_#t~post6; 9020#L45-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 9022#L24-2 assume !!(main_~j~0 <= main_~r~0); 9073#L25 [2019-11-20 02:57:45,153 INFO L796 eck$LassoCheckResult]: Loop: 9073#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; 9070#L4 assume !(0 == __VERIFIER_assert_~cond); 9068#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; 9062#L4-3 assume !(0 == __VERIFIER_assert_~cond); 9048#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; 9005#L4-6 assume !(0 == __VERIFIER_assert_~cond); 8999#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; 8993#L4-9 assume !(0 == __VERIFIER_assert_~cond); 8994#L4-11 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; 9024#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; 9025#L4-12 assume !(0 == __VERIFIER_assert_~cond); 9017#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; 9011#L4-15 assume !(0 == __VERIFIER_assert_~cond); 9012#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; 9045#L4-18 assume !(0 == __VERIFIER_assert_~cond); 9041#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; 9037#L4-21 assume !(0 == __VERIFIER_assert_~cond); 9038#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; 9065#L4-24 assume !(0 == __VERIFIER_assert_~cond); 9051#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; 9008#L4-27 assume !(0 == __VERIFIER_assert_~cond); 9001#L4-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 9002#L24-2 assume !!(main_~j~0 <= main_~r~0); 9073#L25 [2019-11-20 02:57:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash -430226800, now seen corresponding path program 2 times [2019-11-20 02:57:45,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:45,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036984459] [2019-11-20 02:57:45,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:45,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 992185381, now seen corresponding path program 1 times [2019-11-20 02:57:45,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:45,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673207031] [2019-11-20 02:57:45,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:45,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:45,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1977821002, now seen corresponding path program 1 times [2019-11-20 02:57:45,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:57:45,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044937183] [2019-11-20 02:57:45,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:57:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:57:45,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:57:45,464 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-11-20 02:57:45,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-20 02:57:45,821 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:45,821 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:45,821 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:45,821 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:45,822 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:57:45,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:45,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:45,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:45,822 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-20 02:57:45,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:45,822 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:45,823 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-20 02:57:45,830 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-20 02:57:45,835 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-20 02:57:45,850 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-20 02:57:45,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:45,931 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:57:45,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:45,941 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:45,945 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:57:45,945 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:57:45,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:45,955 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:45,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:57:45,960 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:57:45,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:57:45,971 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:57:45,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:57:45,983 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:46,056 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:57:46,058 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:57:46,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:57:46,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:57:46,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:57:46,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:57:46,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:46,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:57:46,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:57:46,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-20 02:57:46,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:57:46,059 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:57:46,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-20 02:57:46,062 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-20 02:57:46,073 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-20 02:57:46,077 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-20 02:57:46,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:57:46,134 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:46,137 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-20 02:57:46,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:46,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:46,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:46,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:46,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:46,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:46,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:46,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:46,145 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-20 02:57:46,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:57:46,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:57:46,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:57:46,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:57:46,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:57:46,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:57:46,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:57:46,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:57:46,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 02:57:46,153 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c54d729-c647-41f4-97f4-a9af998181da/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:57:46,156 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:57:46,156 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:57:46,156 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:57:46,156 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~r~0) = -4*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~r~0 Supporting invariants [] [2019-11-20 02:57:46,158 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:57:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:46,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:46,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:46,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:57:46,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:46,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:46,244 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-20 02:57:46,244 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-20 02:57:46,244 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-20 02:57:46,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 617 states and 677 transitions. Complement of second has 13 states. [2019-11-20 02:57:46,391 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-20 02:57:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 02:57:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-20 02:57:46,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-20 02:57:46,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:46,391 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:57:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:46,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:46,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:46,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:57:46,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:46,508 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-20 02:57:46,508 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-20 02:57:46,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-20 02:57:46,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 617 states and 677 transitions. Complement of second has 13 states. [2019-11-20 02:57:46,697 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-20 02:57:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 02:57:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-20 02:57:46,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-20 02:57:46,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:46,698 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:57:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:57:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:46,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:57:46,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:57:46,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:57:46,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:57:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:57:46,813 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-20 02:57:46,814 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-20 02:57:46,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-20 02:57:47,079 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 897 states and 970 transitions. Complement of second has 12 states. [2019-11-20 02:57:47,080 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-20 02:57:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 02:57:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2019-11-20 02:57:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-20 02:57:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 41 letters. Loop has 23 letters. [2019-11-20 02:57:47,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:47,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 46 letters. [2019-11-20 02:57:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:57:47,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 897 states and 970 transitions. [2019-11-20 02:57:47,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 02:57:47,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 897 states to 0 states and 0 transitions. [2019-11-20 02:57:47,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 02:57:47,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 02:57:47,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 02:57:47,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:57:47,093 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:57:47,093 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:57:47,093 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:57:47,093 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 02:57:47,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:57:47,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 02:57:47,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 02:57:47,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 02:57:47 BoogieIcfgContainer [2019-11-20 02:57:47,100 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 02:57:47,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:57:47,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:57:47,101 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:57:47,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:57:33" (3/4) ... [2019-11-20 02:57:47,104 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 02:57:47,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:57:47,107 INFO L168 Benchmark]: Toolchain (without parser) took 14805.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.4 MB). Free memory was 950.1 MB in the beginning and 850.9 MB in the end (delta: 99.2 MB). Peak memory consumption was 452.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:47,107 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:57:47,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:47,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.63 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-20 02:57:47,108 INFO L168 Benchmark]: Boogie Preprocessor took 24.12 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-20 02:57:47,108 INFO L168 Benchmark]: RCFGBuilder took 406.93 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:47,109 INFO L168 Benchmark]: BuchiAutomizer took 14063.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 850.9 MB in the end (delta: 236.6 MB). Peak memory consumption was 462.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:57:47,111 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.4 GB. Free memory is still 850.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:57:47,113 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.63 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 24.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 406.93 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14063.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 850.9 MB in the end (delta: 236.6 MB). Peak memory consumption was 462.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.4 GB. Free memory is still 850.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (8 trivial, 5 deterministic, 2 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 -2 * j + 3 * n and consists of 14 locations. One nondeterministic module has affine ranking function 3 * n + -2 * j and consists of 13 locations. One nondeterministic module has affine ranking function -4 * j + 3 * r and consists of 7 locations. 8 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.0s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 8.0s. Construction of modules took 2.1s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 943 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 403 states and ocurred in iteration 9. Nontrivial modules had stage [4, 1, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 988 SDtfs, 1744 SDslu, 1216 SDs, 0 SdLazy, 2038 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT2 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital37 mio100 ax100 hnf97 lsp73 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp98 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 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...