./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nest-if3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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/nest-if3.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 67bb0790f696b3c18eb630bed2fc34fee971c82b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:50:20,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:50:20,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:50:20,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:50:20,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:50:20,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:50:20,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:50:20,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:50:20,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:50:20,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:50:20,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:50:20,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:50:20,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:50:20,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:50:20,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:50:20,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:50:20,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:50:20,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:50:20,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:50:20,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:50:20,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:50:20,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:50:20,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:50:20,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:50:20,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:50:20,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:50:20,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:50:20,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:50:20,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:50:20,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:50:20,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:50:20,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:50:20,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:50:20,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:50:20,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:50:20,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:50:20,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:50:20,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:50:20,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:50:20,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:50:20,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:50:20,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:50:20,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:50:20,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:50:20,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:50:20,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:50:20,452 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:50:20,452 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:50:20,452 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:50:20,452 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:50:20,453 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:50:20,453 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:50:20,453 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:50:20,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:50:20,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:50:20,454 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:50:20,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:50:20,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:50:20,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:50:20,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:50:20,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:50:20,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:50:20,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:50:20,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:50:20,460 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:50:20,460 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:50:20,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:50:20,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:50:20,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:50:20,461 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:50:20,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:50:20,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:50:20,462 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:50:20,462 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:50:20,463 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:50:20,463 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 -> 67bb0790f696b3c18eb630bed2fc34fee971c82b [2019-11-28 20:50:20,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:50:20,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:50:20,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:50:20,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:50:20,821 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:50:20,822 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nest-if3.i [2019-11-28 20:50:20,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976197074/f96f6a4179704b27bc81913683dcadea/FLAGf8e3e1004 [2019-11-28 20:50:21,294 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:50:21,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nest-if3.i [2019-11-28 20:50:21,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976197074/f96f6a4179704b27bc81913683dcadea/FLAGf8e3e1004 [2019-11-28 20:50:21,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976197074/f96f6a4179704b27bc81913683dcadea [2019-11-28 20:50:21,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:50:21,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:50:21,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:50:21,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:50:21,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:50:21,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:50:21" (1/1) ... [2019-11-28 20:50:21,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff623f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:21, skipping insertion in model container [2019-11-28 20:50:21,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:50:21" (1/1) ... [2019-11-28 20:50:21,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:50:21,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:50:22,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:50:22,012 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:50:22,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:50:22,050 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:50:22,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22 WrapperNode [2019-11-28 20:50:22,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:50:22,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:50:22,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:50:22,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:50:22,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:50:22,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:50:22,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:50:22,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:50:22,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (1/1) ... [2019-11-28 20:50:22,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:50:22,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:50:22,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:50:22,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:50:22,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (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 20:50:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:50:22,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:50:22,440 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:50:22,441 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:50:22,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:22 BoogieIcfgContainer [2019-11-28 20:50:22,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:50:22,443 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:50:22,443 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:50:22,447 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:50:22,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:22,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:50:21" (1/3) ... [2019-11-28 20:50:22,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@452ffd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:50:22, skipping insertion in model container [2019-11-28 20:50:22,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:22,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:50:22" (2/3) ... [2019-11-28 20:50:22,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@452ffd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:50:22, skipping insertion in model container [2019-11-28 20:50:22,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:50:22,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:22" (3/3) ... [2019-11-28 20:50:22,452 INFO L371 chiAutomizerObserver]: Analyzing ICFG nest-if3.i [2019-11-28 20:50:22,499 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:50:22,499 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:50:22,499 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:50:22,499 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:50:22,499 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:50:22,499 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:50:22,500 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:50:22,500 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:50:22,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:50:22,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:50:22,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:22,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:22,545 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:50:22,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:50:22,545 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:50:22,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:50:22,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:50:22,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:22,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:22,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:50:22,548 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:50:22,555 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post4, main_#t~nondet5, main_#t~post3, main_~i~0, main_~k~0, main_~n~0, main_~l~0;havoc main_~i~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~l~0 := main_#t~nondet2;havoc main_#t~nondet2; 14#L14true assume !!(main_~l~0 > 0); 3#L15true assume !!(main_~l~0 < 1000000); 7#L16true assume !!(main_~n~0 < 1000000);main_~k~0 := 1; 15#L17-3true [2019-11-28 20:50:22,556 INFO L796 eck$LassoCheckResult]: Loop: 15#L17-3true assume !!(main_~k~0 < main_~n~0);main_~i~0 := main_~l~0; 8#L18-2true assume !true; 4#L18-3true assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~l~0 := 1 + main_~l~0; 5#L17-2true main_#t~post3 := main_~k~0;main_~k~0 := 1 + main_#t~post3;havoc main_#t~post3; 15#L17-3true [2019-11-28 20:50:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,562 INFO L82 PathProgramCache]: Analyzing trace with hash 959435, now seen corresponding path program 1 times [2019-11-28 20:50:22,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015221032] [2019-11-28 20:50:22,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,666 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1683322, now seen corresponding path program 1 times [2019-11-28 20:50:22,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294837368] [2019-11-28 20:50:22,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:22,694 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 20:50:22,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294837368] [2019-11-28 20:50:22,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:50:22,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:50:22,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989487460] [2019-11-28 20:50:22,703 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:50:22,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:22,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:50:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:50:22,722 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-28 20:50:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:22,729 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-28 20:50:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:50:22,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-28 20:50:22,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:50:22,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2019-11-28 20:50:22,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:50:22,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:50:22,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2019-11-28 20:50:22,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:22,739 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 20:50:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2019-11-28 20:50:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 20:50:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:50:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-28 20:50:22,765 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 20:50:22,766 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 20:50:22,766 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:50:22,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-28 20:50:22,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:50:22,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:22,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:22,767 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:50:22,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:50:22,768 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post4, main_#t~nondet5, main_#t~post3, main_~i~0, main_~k~0, main_~n~0, main_~l~0;havoc main_~i~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~l~0 := main_#t~nondet2;havoc main_#t~nondet2; 42#L14 assume !!(main_~l~0 > 0); 39#L15 assume !!(main_~l~0 < 1000000); 40#L16 assume !!(main_~n~0 < 1000000);main_~k~0 := 1; 38#L17-3 [2019-11-28 20:50:22,768 INFO L796 eck$LassoCheckResult]: Loop: 38#L17-3 assume !!(main_~k~0 < main_~n~0);main_~i~0 := main_~l~0; 43#L18-2 assume !(main_~i~0 < main_~n~0); 36#L18-3 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~l~0 := 1 + main_~l~0; 37#L17-2 main_#t~post3 := main_~k~0;main_~k~0 := 1 + main_#t~post3;havoc main_#t~post3; 38#L17-3 [2019-11-28 20:50:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash 959435, now seen corresponding path program 2 times [2019-11-28 20:50:22,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925034177] [2019-11-28 20:50:22,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,785 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1668907, now seen corresponding path program 1 times [2019-11-28 20:50:22,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654306998] [2019-11-28 20:50:22,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1295853045, now seen corresponding path program 1 times [2019-11-28 20:50:22,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:22,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066501100] [2019-11-28 20:50:22,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:22,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:22,984 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:22,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:22,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:22,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:22,986 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:22,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:22,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:22,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:22,987 INFO L133 ssoRankerPreferences]: Filename of dumped script: nest-if3.i_Iteration2_Loop [2019-11-28 20:50:22,987 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:22,987 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:23,028 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 20:50:23,041 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 20:50:23,080 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 20:50:23,191 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:23,192 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 20:50:23,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:23,200 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 [2019-11-28 20:50:23,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:50:23,212 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:23,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,227 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:23,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:23,535 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:23,538 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:23,538 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:23,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:23,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:23,538 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:23,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:23,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:23,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: nest-if3.i_Iteration2_Loop [2019-11-28 20:50:23,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:23,543 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:23,544 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 20:50:23,553 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 20:50:23,572 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 20:50:23,658 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:23,665 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:50:23,673 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 20:50:23,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:23,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:23,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:23,678 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:50:23,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:23,683 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:50:23,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe 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) [2019-11-28 20:50:23,707 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 20:50:23,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:23,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:23,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:23,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:23,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:23,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:23,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,723 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:23,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:23,743 INFO L444 ModelExtractionUtils]: 3 out of 6 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:23,753 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:23,753 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:23,753 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:23,754 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~k~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:23,760 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:23,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:23,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:23,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:23,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:23,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:23,849 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 20:50:23,855 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 20:50:23,856 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-28 20:50:23,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 17 states and 23 transitions. Complement of second has 4 states. [2019-11-28 20:50:23,901 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 20:50:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-28 20:50:23,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-28 20:50:23,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:23,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-28 20:50:23,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:23,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. [2019-11-28 20:50:23,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:23,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-11-28 20:50:23,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:50:23,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2019-11-28 20:50:23,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:50:23,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:50:23,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 20:50:23,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:23,911 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:50:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 20:50:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-28 20:50:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 20:50:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-28 20:50:23,913 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-28 20:50:23,913 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-28 20:50:23,914 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:50:23,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-28 20:50:23,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:50:23,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:23,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:23,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:50:23,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:50:23,916 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post4, main_#t~nondet5, main_#t~post3, main_~i~0, main_~k~0, main_~n~0, main_~l~0;havoc main_~i~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~l~0 := main_#t~nondet2;havoc main_#t~nondet2; 117#L14 assume !!(main_~l~0 > 0); 110#L15 assume !!(main_~l~0 < 1000000); 111#L16 assume !!(main_~n~0 < 1000000);main_~k~0 := 1; 118#L17-3 assume !!(main_~k~0 < main_~n~0);main_~i~0 := main_~l~0; 112#L18-2 [2019-11-28 20:50:23,916 INFO L796 eck$LassoCheckResult]: Loop: 112#L18-2 assume !!(main_~i~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 113#L4 assume !(0 == __VERIFIER_assert_~cond); 119#L4-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 112#L18-2 [2019-11-28 20:50:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash 29742509, now seen corresponding path program 1 times [2019-11-28 20:50:23,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840687821] [2019-11-28 20:50:23,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,929 INFO L82 PathProgramCache]: Analyzing trace with hash 61795, now seen corresponding path program 1 times [2019-11-28 20:50:23,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232431956] [2019-11-28 20:50:23,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1295854647, now seen corresponding path program 1 times [2019-11-28 20:50:23,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:23,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718513676] [2019-11-28 20:50:23,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:23,982 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,013 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:24,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:24,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:24,014 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:24,014 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:24,014 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,014 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:24,014 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:24,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: nest-if3.i_Iteration3_Loop [2019-11-28 20:50:24,014 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:24,015 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:24,016 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 20:50:24,034 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 20:50:24,116 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:24,116 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:24,136 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 20:50:24,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:24,151 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,202 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:24,204 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:24,205 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:24,205 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:24,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:24,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:24,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,206 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:24,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:24,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: nest-if3.i_Iteration3_Loop [2019-11-28 20:50:24,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:24,206 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:24,208 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 20:50:24,230 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 20:50:24,316 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:24,317 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:50:24,330 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 20:50:24,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:24,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:24,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:24,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:24,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:24,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:24,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,342 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:24,349 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:50:24,349 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:24,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:24,364 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:24,364 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:24,364 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,368 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:50:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:24,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:24,412 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:24,429 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 20:50:24,429 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 20:50:24,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:50:24,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 31 states and 40 transitions. Complement of second has 7 states. [2019-11-28 20:50:24,461 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 20:50:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 20:50:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 20:50:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 20:50:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:50:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:24,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-28 20:50:24,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:50:24,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2019-11-28 20:50:24,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:50:24,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:50:24,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-28 20:50:24,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:50:24,470 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-28 20:50:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-28 20:50:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-11-28 20:50:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 20:50:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-28 20:50:24,477 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 20:50:24,477 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 20:50:24,477 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:50:24,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-28 20:50:24,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:50:24,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:50:24,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:50:24,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:50:24,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:50:24,481 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post4, main_#t~nondet5, main_#t~post3, main_~i~0, main_~k~0, main_~n~0, main_~l~0;havoc main_~i~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~l~0 := main_#t~nondet2;havoc main_#t~nondet2; 211#L14 assume !!(main_~l~0 > 0); 200#L15 assume !!(main_~l~0 < 1000000); 201#L16 assume !!(main_~n~0 < 1000000);main_~k~0 := 1; 209#L17-3 assume !!(main_~k~0 < main_~n~0);main_~i~0 := main_~l~0; 207#L18-2 assume !(main_~i~0 < main_~n~0); 202#L18-3 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5; 203#L17-2 main_#t~post3 := main_~k~0;main_~k~0 := 1 + main_#t~post3;havoc main_#t~post3; 204#L17-3 assume !!(main_~k~0 < main_~n~0);main_~i~0 := main_~l~0; 205#L18-2 [2019-11-28 20:50:24,481 INFO L796 eck$LassoCheckResult]: Loop: 205#L18-2 assume !!(main_~i~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 206#L4 assume !(0 == __VERIFIER_assert_~cond); 212#L4-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 205#L18-2 [2019-11-28 20:50:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1516740677, now seen corresponding path program 1 times [2019-11-28 20:50:24,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35158907] [2019-11-28 20:50:24,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash 61795, now seen corresponding path program 2 times [2019-11-28 20:50:24,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647923636] [2019-11-28 20:50:24,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:50:24,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:50:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2129380705, now seen corresponding path program 1 times [2019-11-28 20:50:24,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:50:24,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238311686] [2019-11-28 20:50:24,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:50:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:24,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238311686] [2019-11-28 20:50:24,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583917144] [2019-11-28 20:50:24,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:50:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:24,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:24,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:50:24,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:50:24,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 20:50:24,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758649261] [2019-11-28 20:50:24,722 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:24,722 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:24,722 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:24,722 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:24,722 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:50:24,723 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:24,723 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:24,723 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:24,723 INFO L133 ssoRankerPreferences]: Filename of dumped script: nest-if3.i_Iteration4_Loop [2019-11-28 20:50:24,723 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:24,723 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:24,727 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 20:50:24,742 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 20:50:24,812 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:24,813 INFO L404 LassoAnalysis]: Checking for nontermination... 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 20:50:24,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:50:24,826 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 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 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 20:50:24,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:50:24,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:50:25,022 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:50:25,026 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:50:25,026 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:50:25,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:50:25,026 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:50:25,027 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:50:25,027 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,027 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:50:25,027 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:50:25,027 INFO L133 ssoRankerPreferences]: Filename of dumped script: nest-if3.i_Iteration4_Loop [2019-11-28 20:50:25,027 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:50:25,028 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:50:25,029 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 20:50:25,036 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 20:50:25,131 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:50:25,132 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:50:25,146 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 20:50:25,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:25,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:25,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:25,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:25,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:25,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:25,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,152 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:50:25,163 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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:50:25,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:50:25,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:50:25,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:50:25,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:50:25,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:50:25,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:50:25,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:50:25,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:50:25,181 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:50:25,182 INFO L444 ModelExtractionUtils]: 3 out of 6 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 20:50:25,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:50:25,196 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:50:25,196 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:50:25,196 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 20:50:25,199 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 20:50:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,263 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 20:50:25,264 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:50:25,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 20:50:25,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 32 transitions. Complement of second has 7 states. [2019-11-28 20:50:25,290 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 20:50:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 20:50:25,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-28 20:50:25,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:25,293 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,341 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 20:50:25,342 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:50:25,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 20:50:25,365 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 32 transitions. Complement of second has 7 states. [2019-11-28 20:50:25,365 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 20:50:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 20:50:25,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-28 20:50:25,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:25,366 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:50:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:50:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:50:25,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:50:25,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:50:25,415 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 20:50:25,416 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 2 loop predicates [2019-11-28 20:50:25,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 20:50:25,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 6 states. [2019-11-28 20:50:25,442 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 20:50:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:50:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-11-28 20:50:25,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-28 20:50:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:25,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-28 20:50:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-28 20:50:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:50:25,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-11-28 20:50:25,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:25,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-11-28 20:50:25,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:50:25,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:50:25,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:50:25,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:25,451 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:25,451 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:25,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:50:25,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:50:25,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:50:25,452 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-11-28 20:50:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:50:25,452 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 20:50:25,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:50:25,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 20:50:25,453 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:25,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:50:25,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:50:25,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:50:25,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:50:25,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:50:25,454 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:25,454 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:25,454 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:50:25,454 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:50:25,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:50:25,454 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:50:25,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:50:25,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:50:25 BoogieIcfgContainer [2019-11-28 20:50:25,462 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:50:25,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:50:25,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:50:25,464 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:50:25,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:50:22" (3/4) ... [2019-11-28 20:50:25,471 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:50:25,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:50:25,480 INFO L168 Benchmark]: Toolchain (without parser) took 3745.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 957.7 MB in the beginning and 835.2 MB in the end (delta: 122.4 MB). Peak memory consumption was 243.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:25,481 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:25,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.57 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:25,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:25,484 INFO L168 Benchmark]: Boogie Preprocessor took 37.00 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:25,484 INFO L168 Benchmark]: RCFGBuilder took 250.38 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:25,488 INFO L168 Benchmark]: BuchiAutomizer took 3019.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 835.2 MB in the end (delta: 262.7 MB). Peak memory consumption was 262.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:50:25,489 INFO L168 Benchmark]: Witness Printer took 7.21 ms. Allocated memory is still 1.2 GB. Free memory is still 835.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:50:25,501 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.57 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 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 100.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.00 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 250.38 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3019.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 835.2 MB in the end (delta: 262.7 MB). Peak memory consumption was 262.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.21 ms. Allocated memory is still 1.2 GB. Free memory is still 835.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * k and consists of 3 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + n and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 70 SDtfs, 66 SDslu, 28 SDs, 0 SdLazy, 41 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf98 lsp94 ukn100 mio100 lsp100 div100 bol100 ite121 ukn100 eq169 hnf91 smp70 dnf100 smp100 tf106 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...