./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-30f4e4a [2019-11-28 03:17:50,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:17:50,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:17:50,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:17:50,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:17:50,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:17:50,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:17:50,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:17:50,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:17:50,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:17:50,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:17:50,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:17:50,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:17:50,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:17:50,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:17:50,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:17:50,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:17:50,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:17:50,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:17:50,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:17:50,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:17:50,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:17:50,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:17:50,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:17:50,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:17:50,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:17:50,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:17:50,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:17:50,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:17:50,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:17:50,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:17:50,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:17:50,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:17:50,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:17:50,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:17:50,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:17:50,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:17:50,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:17:50,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:17:50,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:17:50,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:17:50,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:17:50,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:17:50,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:17:50,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:17:50,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:17:50,243 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:17:50,243 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:17:50,243 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:17:50,244 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:17:50,244 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:17:50,244 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:17:50,244 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:17:50,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:17:50,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:17:50,245 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:17:50,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:17:50,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:17:50,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:17:50,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:17:50,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:17:50,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:17:50,247 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:17:50,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:17:50,247 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:17:50,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:17:50,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:17:50,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:17:50,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:17:50,248 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:17:50,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:17:50,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:17:50,249 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:17:50,253 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:17:50,253 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-28 03:17:50,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:17:50,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:17:50,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:17:50,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:17:50,553 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:17:50,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-28 03:17:50,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07dbaa89e/7838929631cc4d6a9b8c29a923739ebc/FLAGa324306b9 [2019-11-28 03:17:51,101 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:17:51,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2019-11-28 03:17:51,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07dbaa89e/7838929631cc4d6a9b8c29a923739ebc/FLAGa324306b9 [2019-11-28 03:17:51,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07dbaa89e/7838929631cc4d6a9b8c29a923739ebc [2019-11-28 03:17:51,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:17:51,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:17:51,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:51,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:17:51,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:17:51,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7367900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51, skipping insertion in model container [2019-11-28 03:17:51,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:17:51,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:17:51,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:51,714 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:17:51,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:17:51,745 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:17:51,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51 WrapperNode [2019-11-28 03:17:51,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:17:51,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:51,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:17:51,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:17:51,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:17:51,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:17:51,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:17:51,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:17:51,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... [2019-11-28 03:17:51,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:17:51,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:17:51,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:17:51,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:17:51,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:17:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:17:52,265 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:17:52,265 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 03:17:52,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:52 BoogieIcfgContainer [2019-11-28 03:17:52,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:17:52,268 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:17:52,268 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:17:52,271 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:17:52,272 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:52,272 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:17:51" (1/3) ... [2019-11-28 03:17:52,273 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fffba24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:52, skipping insertion in model container [2019-11-28 03:17:52,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:52,273 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:51" (2/3) ... [2019-11-28 03:17:52,274 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fffba24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:17:52, skipping insertion in model container [2019-11-28 03:17:52,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:17:52,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:52" (3/3) ... [2019-11-28 03:17:52,275 INFO L371 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2019-11-28 03:17:52,332 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:17:52,332 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:17:52,332 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:17:52,332 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:17:52,333 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:17:52,333 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:17:52,333 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:17:52,333 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:17:52,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-28 03:17:52,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-28 03:17:52,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:52,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:52,374 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:52,374 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:52,375 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:17:52,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2019-11-28 03:17:52,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-28 03:17:52,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:52,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:52,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:52,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:52,386 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-28 03:17:52,387 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-28 03:17:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:52,392 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-11-28 03:17:52,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:52,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940597104] [2019-11-28 03:17:52,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115875, now seen corresponding path program 1 times [2019-11-28 03:17:52,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:52,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028639089] [2019-11-28 03:17:52,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:52,542 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-28 03:17:52,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028639089] [2019-11-28 03:17:52,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:52,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:17:52,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525285274] [2019-11-28 03:17:52,551 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:17:52,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:52,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:17:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:17:52,569 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-11-28 03:17:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:52,579 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-28 03:17:52,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:17:52,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2019-11-28 03:17:52,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 03:17:52,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 42 transitions. [2019-11-28 03:17:52,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-28 03:17:52,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-28 03:17:52,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-11-28 03:17:52,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:52,591 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 03:17:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-11-28 03:17:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 03:17:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 03:17:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-28 03:17:52,622 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 03:17:52,622 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 03:17:52,623 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:17:52,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-28 03:17:52,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 03:17:52,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:52,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:52,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:52,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:52,625 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-28 03:17:52,625 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-28 03:17:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:52,626 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 2 times [2019-11-28 03:17:52,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:52,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331898172] [2019-11-28 03:17:52,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,648 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1043651989, now seen corresponding path program 1 times [2019-11-28 03:17:52,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:52,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331251281] [2019-11-28 03:17:52,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:52,706 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-28 03:17:52,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331251281] [2019-11-28 03:17:52,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:52,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:17:52,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404795265] [2019-11-28 03:17:52,707 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:17:52,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:17:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:17:52,709 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 03:17:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:52,844 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-11-28 03:17:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:17:52,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2019-11-28 03:17:52,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-28 03:17:52,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 80 transitions. [2019-11-28 03:17:52,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-28 03:17:52,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-11-28 03:17:52,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 80 transitions. [2019-11-28 03:17:52,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:52,851 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-11-28 03:17:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 80 transitions. [2019-11-28 03:17:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2019-11-28 03:17:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 03:17:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-28 03:17:52,856 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-28 03:17:52,856 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-28 03:17:52,856 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:17:52,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-11-28 03:17:52,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 03:17:52,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:52,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:52,858 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:52,858 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:52,858 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-28 03:17:52,858 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-28 03:17:52,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:52,859 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 3 times [2019-11-28 03:17:52,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:52,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598076829] [2019-11-28 03:17:52,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 1 times [2019-11-28 03:17:52,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:52,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185700800] [2019-11-28 03:17:52,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:52,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash -769702287, now seen corresponding path program 1 times [2019-11-28 03:17:52,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:52,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474095218] [2019-11-28 03:17:52,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:52,931 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-28 03:17:52,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474095218] [2019-11-28 03:17:52,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:52,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:17:52,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886868042] [2019-11-28 03:17:53,123 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:53,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:53,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:53,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:53,124 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:53,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:53,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:53,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:53,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-28 03:17:53,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:53,125 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:53,151 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-28 03:17:53,176 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-28 03:17:53,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:53,270 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:53,271 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:53,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:53,279 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:53,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:53,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:17:53,512 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:53,514 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:53,515 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:53,515 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:53,515 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:53,515 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:53,515 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:53,515 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:53,515 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:53,516 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2019-11-28 03:17:53,516 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:53,516 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:53,518 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-28 03:17:53,525 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-28 03:17:53,541 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-28 03:17:53,646 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:53,652 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:53,667 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-28 03:17:53,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:53,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:53,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:53,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:53,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:53,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:53,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:53,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:53,694 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-28 03:17:53,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:53,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:53,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:53,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:53,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:53,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:53,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:53,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:53,718 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-28 03:17:53,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:53,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:53,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:53,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:53,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:53,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:53,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:53,738 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:53,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:17:53,764 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:53,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:53,778 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:53,779 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:53,779 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:53,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:17:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:53,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:53,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:53,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:53,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:53,866 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-28 03:17:53,872 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-28 03:17:53,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 45 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 03:17:53,949 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-28 03:17:53,951 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-28 03:17:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:17:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2019-11-28 03:17:53,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-28 03:17:53,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:53,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-28 03:17:53,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:53,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-28 03:17:53,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:53,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2019-11-28 03:17:53,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2019-11-28 03:17:53,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 106 states and 125 transitions. [2019-11-28 03:17:53,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-28 03:17:53,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-11-28 03:17:53,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 125 transitions. [2019-11-28 03:17:53,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:53,974 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-11-28 03:17:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 125 transitions. [2019-11-28 03:17:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-28 03:17:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 03:17:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-28 03:17:53,986 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-28 03:17:53,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:53,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:17:53,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:17:53,987 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 3 states. [2019-11-28 03:17:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:54,010 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-11-28 03:17:54,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:17:54,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 147 transitions. [2019-11-28 03:17:54,015 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2019-11-28 03:17:54,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 110 transitions. [2019-11-28 03:17:54,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-28 03:17:54,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-28 03:17:54,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 110 transitions. [2019-11-28 03:17:54,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:17:54,018 INFO L688 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-11-28 03:17:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 110 transitions. [2019-11-28 03:17:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-11-28 03:17:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 03:17:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-28 03:17:54,024 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 03:17:54,024 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 03:17:54,024 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:17:54,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-28 03:17:54,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2019-11-28 03:17:54,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:54,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:54,026 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:54,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:54,026 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-28 03:17:54,026 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-28 03:17:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2019-11-28 03:17:54,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:54,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802085599] [2019-11-28 03:17:54,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:54,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1064646699, now seen corresponding path program 2 times [2019-11-28 03:17:54,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:54,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361448219] [2019-11-28 03:17:54,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:54,062 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 39644339, now seen corresponding path program 1 times [2019-11-28 03:17:54,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:54,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16120645] [2019-11-28 03:17:54,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:54,111 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-28 03:17:54,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16120645] [2019-11-28 03:17:54,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:54,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:17:54,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297768166] [2019-11-28 03:17:54,240 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:54,240 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:54,240 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:54,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:54,241 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:54,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:54,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:54,241 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:54,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-28 03:17:54,241 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:54,242 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:54,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:54,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-28 03:17:54,261 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-28 03:17:54,333 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:54,334 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:54,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:54,347 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:54,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:17:54,352 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:54,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:54,368 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:54,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:54,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:17:54,780 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:54,784 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:54,784 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:54,784 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:54,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:54,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:54,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:54,785 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:54,785 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:54,785 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2019-11-28 03:17:54,785 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:54,785 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:54,789 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-28 03:17:54,808 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-28 03:17:54,828 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-28 03:17:54,902 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:54,903 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:54,912 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-28 03:17:54,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:54,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:54,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:54,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:54,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:54,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:54,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:54,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:54,932 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-28 03:17:54,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:54,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:54,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:54,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:54,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:54,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:54,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:54,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:54,954 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:17:54,954 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:54,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:54,973 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:54,973 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:54,973 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-28 03:17:54,976 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:54,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:54,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:55,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:55,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:55,018 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-28 03:17:55,018 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-28 03:17:55,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-11-28 03:17:55,047 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-28 03:17:55,048 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-28 03:17:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:17:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2019-11-28 03:17:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-28 03:17:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-28 03:17:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:55,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-28 03:17:55,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:55,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 181 transitions. [2019-11-28 03:17:55,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2019-11-28 03:17:55,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 120 states and 140 transitions. [2019-11-28 03:17:55,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-28 03:17:55,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-11-28 03:17:55,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 140 transitions. [2019-11-28 03:17:55,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:55,060 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-28 03:17:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 140 transitions. [2019-11-28 03:17:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2019-11-28 03:17:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 03:17:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-28 03:17:55,074 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-28 03:17:55,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:17:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:17:55,077 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-11-28 03:17:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:55,254 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-11-28 03:17:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:17:55,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2019-11-28 03:17:55,257 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-11-28 03:17:55,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 220 transitions. [2019-11-28 03:17:55,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-28 03:17:55,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-11-28 03:17:55,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2019-11-28 03:17:55,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:55,260 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-11-28 03:17:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2019-11-28 03:17:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 64. [2019-11-28 03:17:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 03:17:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-28 03:17:55,266 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 03:17:55,266 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 03:17:55,266 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:17:55,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2019-11-28 03:17:55,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 03:17:55,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:55,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:55,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:17:55,268 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:55,268 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-28 03:17:55,268 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-28 03:17:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 4 times [2019-11-28 03:17:55,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:55,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345605256] [2019-11-28 03:17:55,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2136697343, now seen corresponding path program 1 times [2019-11-28 03:17:55,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:55,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034583097] [2019-11-28 03:17:55,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:55,310 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737125, now seen corresponding path program 1 times [2019-11-28 03:17:55,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:55,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506680731] [2019-11-28 03:17:55,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:55,367 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-28 03:17:55,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506680731] [2019-11-28 03:17:55,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:55,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:17:55,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394928469] [2019-11-28 03:17:55,500 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-28 03:17:55,636 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-11-28 03:17:55,637 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:55,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:55,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:55,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:55,638 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:55,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:55,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:55,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-28 03:17:55,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:55,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:55,642 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-28 03:17:55,656 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-28 03:17:55,660 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-28 03:17:55,666 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-28 03:17:55,748 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:55,748 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:55,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:55,760 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:55,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:17:55,798 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:55,800 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:55,800 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:55,800 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:55,800 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:55,800 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:55,800 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:55,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:55,801 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2019-11-28 03:17:55,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:55,801 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:55,802 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-28 03:17:55,818 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-28 03:17:55,821 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-28 03:17:55,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-28 03:17:55,900 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:55,900 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:55,909 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-28 03:17:55,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:55,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:55,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:55,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:55,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:55,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:55,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:55,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:55,931 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 03:17:55,931 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:55,938 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:55,939 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:55,939 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:55,939 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-28 03:17:55,942 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:55,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:55,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:55,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:55,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:55,994 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-28 03:17:55,995 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-28 03:17:55,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 75 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 03:17:56,025 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-28 03:17:56,025 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-28 03:17:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:17:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2019-11-28 03:17:56,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 13 letters. [2019-11-28 03:17:56,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:56,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2019-11-28 03:17:56,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:56,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 3 letters. Loop has 26 letters. [2019-11-28 03:17:56,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:56,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-11-28 03:17:56,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-28 03:17:56,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 138 transitions. [2019-11-28 03:17:56,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-28 03:17:56,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-28 03:17:56,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 138 transitions. [2019-11-28 03:17:56,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:56,031 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-11-28 03:17:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 138 transitions. [2019-11-28 03:17:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-11-28 03:17:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 03:17:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-11-28 03:17:56,036 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-11-28 03:17:56,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:56,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:17:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:17:56,037 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 4 states. [2019-11-28 03:17:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:56,066 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-28 03:17:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:17:56,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 75 transitions. [2019-11-28 03:17:56,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 03:17:56,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 74 transitions. [2019-11-28 03:17:56,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 03:17:56,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 03:17:56,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2019-11-28 03:17:56,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:56,069 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 03:17:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2019-11-28 03:17:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 03:17:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 03:17:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-28 03:17:56,072 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 03:17:56,072 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 03:17:56,072 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:17:56,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 74 transitions. [2019-11-28 03:17:56,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2019-11-28 03:17:56,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:56,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:56,074 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:17:56,074 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:56,074 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-28 03:17:56,074 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-28 03:17:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash 959377, now seen corresponding path program 1 times [2019-11-28 03:17:56,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223933790] [2019-11-28 03:17:56,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,088 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1321235687, now seen corresponding path program 2 times [2019-11-28 03:17:56,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578598955] [2019-11-28 03:17:56,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:56,124 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:56,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:56,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1718346921, now seen corresponding path program 1 times [2019-11-28 03:17:56,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:56,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077616890] [2019-11-28 03:17:56,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:56,199 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-28 03:17:56,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077616890] [2019-11-28 03:17:56,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:56,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:17:56,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361134520] [2019-11-28 03:17:56,419 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-11-28 03:17:56,424 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:56,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:56,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:56,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:56,424 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:56,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:56,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:56,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-28 03:17:56,425 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:56,425 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:56,426 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-28 03:17:56,431 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-28 03:17:56,433 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-28 03:17:56,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-28 03:17:56,534 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:56,535 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:56,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:56,552 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,557 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:17:56,558 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:56,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:56,571 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,576 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:17:56,576 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:56,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:56,586 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:56,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:56,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:17:56,871 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:56,874 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:56,874 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:56,874 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:56,874 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:56,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:56,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:56,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:56,875 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2019-11-28 03:17:56,875 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:56,875 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:56,877 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-28 03:17:56,881 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-28 03:17:56,884 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-28 03:17:56,886 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-28 03:17:56,975 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:56,975 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:56,990 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-28 03:17:56,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:56,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:56,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:56,992 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:17:56,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:56,993 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:17:56,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:56,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,005 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-28 03:17:57,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:57,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:57,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:57,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:57,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:57,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:57,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,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-28 03:17:57,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:57,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:57,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:57,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:57,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:57,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:17:57,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:57,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-28 03:17:57,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:57,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:57,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:57,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:57,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:57,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:57,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:57,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:57,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:17:57,055 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:57,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:57,060 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:57,060 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:57,060 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-28 03:17:57,062 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-28 03:17:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:57,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:57,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:57,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:17:57,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:57,115 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-28 03:17:57,116 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-28 03:17:57,116 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 74 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 03:17:57,190 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-28 03:17:57,191 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-28 03:17:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:17:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2019-11-28 03:17:57,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 13 letters. [2019-11-28 03:17:57,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:57,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 17 letters. Loop has 13 letters. [2019-11-28 03:17:57,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:57,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 26 letters. [2019-11-28 03:17:57,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:17:57,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 150 transitions. [2019-11-28 03:17:57,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:17:57,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 122 states and 143 transitions. [2019-11-28 03:17:57,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:17:57,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 03:17:57,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 143 transitions. [2019-11-28 03:17:57,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:57,205 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-11-28 03:17:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 143 transitions. [2019-11-28 03:17:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-28 03:17:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 03:17:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-11-28 03:17:57,210 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-11-28 03:17:57,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:57,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:17:57,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:17:57,211 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 6 states. [2019-11-28 03:17:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:57,384 INFO L93 Difference]: Finished difference Result 401 states and 447 transitions. [2019-11-28 03:17:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:17:57,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 447 transitions. [2019-11-28 03:17:57,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2019-11-28 03:17:57,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 353 states and 395 transitions. [2019-11-28 03:17:57,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-11-28 03:17:57,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-11-28 03:17:57,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 395 transitions. [2019-11-28 03:17:57,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:57,392 INFO L688 BuchiCegarLoop]: Abstraction has 353 states and 395 transitions. [2019-11-28 03:17:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 395 transitions. [2019-11-28 03:17:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 121. [2019-11-28 03:17:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 03:17:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-11-28 03:17:57,397 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-28 03:17:57,397 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-11-28 03:17:57,397 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:17:57,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 141 transitions. [2019-11-28 03:17:57,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:17:57,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:57,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:57,399 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:57,399 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:17:57,399 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-28 03:17:57,400 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-28 03:17:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,400 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 1 times [2019-11-28 03:17:57,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579195503] [2019-11-28 03:17:57,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1728992636, now seen corresponding path program 1 times [2019-11-28 03:17:57,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021124324] [2019-11-28 03:17:57,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:57,500 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-28 03:17:57,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021124324] [2019-11-28 03:17:57,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:17:57,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:17:57,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110370241] [2019-11-28 03:17:57,502 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:17:57,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:17:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:17:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:17:57,502 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-11-28 03:17:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:17:57,688 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2019-11-28 03:17:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:17:57,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 254 transitions. [2019-11-28 03:17:57,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:17:57,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 240 transitions. [2019-11-28 03:17:57,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 03:17:57,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 03:17:57,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 240 transitions. [2019-11-28 03:17:57,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:17:57,694 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 240 transitions. [2019-11-28 03:17:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 240 transitions. [2019-11-28 03:17:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 163. [2019-11-28 03:17:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-28 03:17:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2019-11-28 03:17:57,698 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-28 03:17:57,698 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 185 transitions. [2019-11-28 03:17:57,699 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:17:57,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 185 transitions. [2019-11-28 03:17:57,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:17:57,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:17:57,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:17:57,701 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:17:57,701 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-28 03:17:57,701 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-28 03:17:57,701 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-28 03:17:57,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash 29740716, now seen corresponding path program 2 times [2019-11-28 03:17:57,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181702050] [2019-11-28 03:17:57,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2022918237, now seen corresponding path program 1 times [2019-11-28 03:17:57,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128813566] [2019-11-28 03:17:57,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:17:57,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:17:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash -301361000, now seen corresponding path program 1 times [2019-11-28 03:17:57,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:17:57,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551936302] [2019-11-28 03:17:57,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:17:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:57,852 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-28 03:17:57,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551936302] [2019-11-28 03:17:57,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174902606] [2019-11-28 03:17:57,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:17:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:57,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:17:57,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:57,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:17:57,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:17:58,102 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-28 03:17:58,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 03:17:58,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-28 03:17:58,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328398228] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:17:58,322 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-28 03:17:58,327 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-28 03:17:59,137 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-11-28 03:17:59,138 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:59,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:59,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:59,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:59,139 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:17:59,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,139 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:59,139 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:59,139 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-28 03:17:59,139 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:59,140 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:59,141 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-28 03:17:59,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:59,157 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-28 03:17:59,162 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-28 03:17:59,238 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:59,238 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:59,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:17:59,245 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:59,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:17:59,264 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,453 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:17:59,455 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:17:59,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:17:59,455 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:17:59,455 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:17:59,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:17:59,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:17:59,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:17:59,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2019-11-28 03:17:59,456 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:17:59,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:17:59,457 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-28 03:17:59,473 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-28 03:17:59,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:59,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:17:59,552 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:17:59,552 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:59,559 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-28 03:17:59,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:17:59,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:17:59,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:17:59,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:17:59,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:17:59,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:17:59,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,566 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:17:59,574 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:17:59,574 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:17:59,582 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:17:59,582 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:17:59,583 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:17:59,583 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 [] Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:17:59,586 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:17:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:17:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:17:59,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:17:59,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:17:59,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:17:59,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:17:59,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:17:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:17:59,769 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-28 03:17:59,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-28 03:18:00,047 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-28 03:18:00,048 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-28 03:18:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 03:18:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2019-11-28 03:18:00,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 78 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-28 03:18:00,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,049 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:00,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:18:00,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:00,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:00,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:00,218 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-28 03:18:00,219 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-28 03:18:00,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 185 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-28 03:18:00,805 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-28 03:18:00,805 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-28 03:18:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 03:18:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2019-11-28 03:18:00,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 23 letters. [2019-11-28 03:18:00,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 28 letters. Loop has 23 letters. [2019-11-28 03:18:00,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 113 transitions. Stem has 5 letters. Loop has 46 letters. [2019-11-28 03:18:00,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:00,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 790 transitions. [2019-11-28 03:18:00,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-28 03:18:00,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 581 states and 644 transitions. [2019-11-28 03:18:00,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-28 03:18:00,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 03:18:00,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 644 transitions. [2019-11-28 03:18:00,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:18:00,819 INFO L688 BuchiCegarLoop]: Abstraction has 581 states and 644 transitions. [2019-11-28 03:18:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 644 transitions. [2019-11-28 03:18:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 409. [2019-11-28 03:18:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-28 03:18:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 456 transitions. [2019-11-28 03:18:00,827 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 456 transitions. [2019-11-28 03:18:00,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:18:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:18:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-28 03:18:00,828 INFO L87 Difference]: Start difference. First operand 409 states and 456 transitions. Second operand 7 states. [2019-11-28 03:18:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:18:01,293 INFO L93 Difference]: Finished difference Result 608 states and 655 transitions. [2019-11-28 03:18:01,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:18:01,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 655 transitions. [2019-11-28 03:18:01,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:18:01,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 302 states and 340 transitions. [2019-11-28 03:18:01,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:18:01,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:18:01,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 340 transitions. [2019-11-28 03:18:01,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:18:01,303 INFO L688 BuchiCegarLoop]: Abstraction has 302 states and 340 transitions. [2019-11-28 03:18:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 340 transitions. [2019-11-28 03:18:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 210. [2019-11-28 03:18:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-28 03:18:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 238 transitions. [2019-11-28 03:18:01,307 INFO L711 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-28 03:18:01,308 INFO L591 BuchiCegarLoop]: Abstraction has 210 states and 238 transitions. [2019-11-28 03:18:01,308 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:18:01,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 238 transitions. [2019-11-28 03:18:01,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:18:01,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:18:01,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:18:01,310 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:18:01,310 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-28 03:18:01,310 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-28 03:18:01,310 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-28 03:18:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1925784365, now seen corresponding path program 1 times [2019-11-28 03:18:01,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:18:01,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012311840] [2019-11-28 03:18:01,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:18:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:01,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:18:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:01,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1855352395, now seen corresponding path program 2 times [2019-11-28 03:18:01,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:18:01,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519656309] [2019-11-28 03:18:01,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:18:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:01,350 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:18:01,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1823630071, now seen corresponding path program 1 times [2019-11-28 03:18:01,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:18:01,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014905720] [2019-11-28 03:18:01,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:18:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:01,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:18:01,597 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-11-28 03:18:01,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-28 03:18:02,167 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2019-11-28 03:18:02,168 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:18:02,168 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:18:02,169 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:18:02,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:18:02,169 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:18:02,169 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:02,169 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:18:02,169 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:18:02,169 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-28 03:18:02,169 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:18:02,169 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:18:02,171 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-28 03:18:02,184 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-28 03:18:02,187 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-28 03:18:02,189 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-28 03:18:02,258 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:18:02,258 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:18:02,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:18:02,263 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:18:02,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:18:02,278 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:02,411 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:18:02,413 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:18:02,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:18:02,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:18:02,413 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:18:02,413 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:18:02,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:02,414 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:18:02,414 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:18:02,414 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2019-11-28 03:18:02,414 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:18:02,414 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:18:02,415 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-28 03:18:02,435 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-28 03:18:02,437 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-28 03:18:02,442 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-28 03:18:02,521 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:18:02,521 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:02,528 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-28 03:18:02,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:18:02,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:18:02,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:18:02,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:18:02,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:18:02,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:18:02,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:18:02,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:18:02,542 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:18:02,542 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:18:02,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:18:02,546 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:02,546 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:18:02,546 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 [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:18:02,548 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:18:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:02,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:02,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:02,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:18:02,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:02,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:02,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:02,665 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-28 03:18:02,665 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-28 03:18:02,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 03:18:02,913 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-28 03:18:02,914 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-28 03:18:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:18:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2019-11-28 03:18:02,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 61 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 03:18:02,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:02,915 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:02,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:02,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:02,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:18:02,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:02,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:03,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:03,050 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-28 03:18:03,051 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-28 03:18:03,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 03:18:03,504 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-28 03:18:03,505 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-28 03:18:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:18:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2019-11-28 03:18:03,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 80 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 03:18:03,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:03,506 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:03,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:03,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:03,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:03,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:18:03,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:03,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:03,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:03,633 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-28 03:18:03,633 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-28 03:18:03,634 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 03:18:03,897 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-28 03:18:03,897 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-28 03:18:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:18:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2019-11-28 03:18:03,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 114 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 03:18:03,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:03,899 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:03,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:03,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:03,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:18:03,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:04,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:04,051 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-28 03:18:04,052 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-28 03:18:04,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 238 transitions. cyclomatic complexity: 32 Second operand 8 states. [2019-11-28 03:18:04,474 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-28 03:18:04,475 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-28 03:18:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:18:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2019-11-28 03:18:04,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 23 letters. [2019-11-28 03:18:04,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:04,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 40 letters. Loop has 23 letters. [2019-11-28 03:18:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:04,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 138 transitions. Stem has 17 letters. Loop has 46 letters. [2019-11-28 03:18:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:04,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 851 transitions. [2019-11-28 03:18:04,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:18:04,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 546 states and 604 transitions. [2019-11-28 03:18:04,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:18:04,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 03:18:04,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 604 transitions. [2019-11-28 03:18:04,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:18:04,488 INFO L688 BuchiCegarLoop]: Abstraction has 546 states and 604 transitions. [2019-11-28 03:18:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 604 transitions. [2019-11-28 03:18:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 403. [2019-11-28 03:18:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-28 03:18:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 449 transitions. [2019-11-28 03:18:04,495 INFO L711 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-28 03:18:04,496 INFO L591 BuchiCegarLoop]: Abstraction has 403 states and 449 transitions. [2019-11-28 03:18:04,496 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:18:04,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 449 transitions. [2019-11-28 03:18:04,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 03:18:04,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:18:04,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:18:04,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:18:04,499 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-28 03:18:04,500 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-28 03:18:04,500 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-28 03:18:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash -430226800, now seen corresponding path program 2 times [2019-11-28 03:18:04,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:18:04,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297852198] [2019-11-28 03:18:04,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:18:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:04,516 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:18:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash 992185381, now seen corresponding path program 1 times [2019-11-28 03:18:04,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:18:04,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419700264] [2019-11-28 03:18:04,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:18:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:04,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:18:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1977821002, now seen corresponding path program 1 times [2019-11-28 03:18:04,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:18:04,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069855250] [2019-11-28 03:18:04,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:18:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:18:04,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:18:04,735 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-11-28 03:18:04,737 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-28 03:18:05,109 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:18:05,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:18:05,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:18:05,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:18:05,110 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:18:05,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:05,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:18:05,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:18:05,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-28 03:18:05,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:18:05,111 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:18:05,111 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-28 03:18:05,114 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-28 03:18:05,119 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-28 03:18:05,131 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-28 03:18:05,192 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:18:05,192 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:05,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:18:05,204 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-28 03:18:05,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:18:05,208 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:05,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:18:05,219 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-28 03:18:05,224 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:18:05,224 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:05,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:18:05,232 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:05,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:18:05,247 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-28 03:18:05,338 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:18:05,340 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:18:05,340 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:18:05,340 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:18:05,340 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:18:05,341 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:18:05,341 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:18:05,341 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:18:05,341 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:18:05,341 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2019-11-28 03:18:05,341 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:18:05,341 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:18:05,342 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-28 03:18:05,345 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-28 03:18:05,359 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-28 03:18:05,363 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-28 03:18:05,428 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:18:05,428 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:05,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:18:05,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:18:05,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:18:05,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:18:05,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:18:05,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:18:05,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:18:05,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:18:05,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:05,449 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-28 03:18:05,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:18:05,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:18:05,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:18:05,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:18:05,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:18:05,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:18:05,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:18:05,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:18:05,458 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:18:05,458 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:18:05,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:18:05,462 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:18:05,462 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:18:05,462 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-28 03:18:05,465 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:18:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:05,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:05,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:05,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:18:05,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:05,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:05,568 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-28 03:18:05,568 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-28 03:18:05,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-28 03:18:05,825 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-28 03:18:05,825 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-28 03:18:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:18:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-28 03:18:05,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-28 03:18:05,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:05,827 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:05,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:05,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:05,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:18:05,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:05,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:05,959 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-28 03:18:05,960 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-28 03:18:05,960 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-28 03:18:06,155 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-28 03:18:06,156 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-28 03:18:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:18:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2019-11-28 03:18:06,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-28 03:18:06,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:06,156 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:18:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:18:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:06,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:18:06,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:18:06,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:18:06,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:18:06,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:18:06,245 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-28 03:18:06,245 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-28 03:18:06,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 449 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-11-28 03:18:06,490 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-28 03:18:06,490 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-28 03:18:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:18:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2019-11-28 03:18:06,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 23 letters. [2019-11-28 03:18:06,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:06,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 41 letters. Loop has 23 letters. [2019-11-28 03:18:06,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:06,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 112 transitions. Stem has 18 letters. Loop has 46 letters. [2019-11-28 03:18:06,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:18:06,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 897 states and 970 transitions. [2019-11-28 03:18:06,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:18:06,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 897 states to 0 states and 0 transitions. [2019-11-28 03:18:06,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:18:06,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:18:06,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:18:06,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:18:06,500 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:06,500 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:06,500 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:18:06,500 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:18:06,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:18:06,501 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:18:06,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:18:06,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:18:06 BoogieIcfgContainer [2019-11-28 03:18:06,508 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:18:06,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:18:06,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:18:06,510 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:18:06,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:52" (3/4) ... [2019-11-28 03:18:06,514 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:18:06,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:18:06,516 INFO L168 Benchmark]: Toolchain (without parser) took 15014.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -338.6 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:06,517 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:18:06,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.00 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:06,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:06,519 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:06,523 INFO L168 Benchmark]: RCFGBuilder took 392.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:06,525 INFO L168 Benchmark]: BuchiAutomizer took 14240.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:18:06,525 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:18:06,528 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 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.00 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.85 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14240.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.75 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.1s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 8.0s. Construction of modules took 2.3s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 943 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s 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.3s 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: 19ms 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...