./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-invgen/nest-if3_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/loop-invgen/nest-if3_true-unreach-call_true-termination.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.24-0ed9222-m [2019-01-14 03:49:09,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:49:09,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:49:09,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:49:09,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:49:09,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:49:09,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:49:09,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:49:09,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:49:09,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:49:09,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:49:09,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:49:09,597 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:49:09,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:49:09,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:49:09,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:49:09,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:49:09,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:49:09,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:49:09,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:49:09,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:49:09,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:49:09,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:49:09,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:49:09,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:49:09,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:49:09,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:49:09,635 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:49:09,636 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:49:09,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:49:09,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:49:09,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:49:09,639 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:49:09,639 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:49:09,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:49:09,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:49:09,642 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:49:09,663 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:49:09,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:49:09,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:49:09,665 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:49:09,665 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:49:09,665 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:49:09,665 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:49:09,666 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:49:09,666 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:49:09,666 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:49:09,666 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:49:09,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:49:09,666 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:49:09,667 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:49:09,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:49:09,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:49:09,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:49:09,667 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:49:09,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:49:09,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:49:09,668 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:49:09,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:49:09,668 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:49:09,668 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:49:09,668 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:49:09,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:49:09,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:49:09,669 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:49:09,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:49:09,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:49:09,669 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:49:09,670 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:49:09,671 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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-01-14 03:49:09,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:49:09,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:49:09,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:49:09,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:49:09,730 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:49:09,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nest-if3_true-unreach-call_true-termination.i [2019-01-14 03:49:09,786 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db676527/b4d43dc8fa3648aa86423645d7ba8df7/FLAG7ff4f79d0 [2019-01-14 03:49:10,183 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:49:10,184 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nest-if3_true-unreach-call_true-termination.i [2019-01-14 03:49:10,188 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db676527/b4d43dc8fa3648aa86423645d7ba8df7/FLAG7ff4f79d0 [2019-01-14 03:49:10,563 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db676527/b4d43dc8fa3648aa86423645d7ba8df7 [2019-01-14 03:49:10,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:49:10,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:49:10,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:49:10,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:49:10,572 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:49:10,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1208df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10, skipping insertion in model container [2019-01-14 03:49:10,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:49:10,599 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:49:10,839 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:49:10,844 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:49:10,866 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:49:10,884 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:49:10,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10 WrapperNode [2019-01-14 03:49:10,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:49:10,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:49:10,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:49:10,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:49:10,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:49:10,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:49:10,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:49:10,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:49:10,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (1/1) ... [2019-01-14 03:49:10,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:49:10,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:49:10,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:49:10,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:49:10,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (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-01-14 03:49:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:49:11,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:49:11,463 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:49:11,463 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 03:49:11,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:11 BoogieIcfgContainer [2019-01-14 03:49:11,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:49:11,465 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:49:11,466 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:49:11,470 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:49:11,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:49:11,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:49:10" (1/3) ... [2019-01-14 03:49:11,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3617d465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:49:11, skipping insertion in model container [2019-01-14 03:49:11,472 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:49:11,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:10" (2/3) ... [2019-01-14 03:49:11,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3617d465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:49:11, skipping insertion in model container [2019-01-14 03:49:11,472 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:49:11,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:11" (3/3) ... [2019-01-14 03:49:11,477 INFO L375 chiAutomizerObserver]: Analyzing ICFG nest-if3_true-unreach-call_true-termination.i [2019-01-14 03:49:11,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:49:11,535 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:49:11,535 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:49:11,535 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:49:11,535 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:49:11,536 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:49:11,536 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:49:11,536 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:49:11,536 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:49:11,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 03:49:11,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 03:49:11,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:11,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:11,583 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:49:11,584 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:49:11,584 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:49:11,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 03:49:11,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 03:49:11,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:11,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:11,587 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:49:11,587 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:49:11,597 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-01-14 03:49:11,598 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-01-14 03:49:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash 959435, now seen corresponding path program 1 times [2019-01-14 03:49:11,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:11,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:11,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:11,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:11,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1683322, now seen corresponding path program 1 times [2019-01-14 03:49:11,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:11,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:11,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:49:11,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:49:11,753 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:49:11,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 03:49:11,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 03:49:11,768 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-14 03:49:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:49:11,775 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-14 03:49:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:49:11,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-14 03:49:11,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 03:49:11,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2019-01-14 03:49:11,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 03:49:11,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 03:49:11,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2019-01-14 03:49:11,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:49:11,785 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 03:49:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2019-01-14 03:49:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 03:49:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 03:49:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-14 03:49:11,814 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 03:49:11,816 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 03:49:11,816 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:49:11,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-14 03:49:11,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 03:49:11,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:11,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:11,819 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:49:11,820 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:49:11,820 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-01-14 03:49:11,820 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-01-14 03:49:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:11,821 INFO L82 PathProgramCache]: Analyzing trace with hash 959435, now seen corresponding path program 2 times [2019-01-14 03:49:11,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:11,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:11,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1668907, now seen corresponding path program 1 times [2019-01-14 03:49:11,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:11,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:11,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:49:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1295853045, now seen corresponding path program 1 times [2019-01-14 03:49:11,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:11,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:11,995 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 03:49:12,053 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:12,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:12,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:12,055 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:12,055 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:12,055 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:12,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:12,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:12,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: nest-if3_true-unreach-call_true-termination.i_Iteration2_Loop [2019-01-14 03:49:12,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:12,056 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:12,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:12,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:12,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:12,360 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:49:12,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:12,395 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:12,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:12,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:12,430 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:49:12,431 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=7} Honda state: {ULTIMATE.start_main_#t~nondet5=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-01-14 03:49:12,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:12,464 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 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 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-01-14 03:49:12,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:12,518 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:12,825 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:12,827 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:12,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:12,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:12,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:12,827 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:12,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:12,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:12,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:12,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: nest-if3_true-unreach-call_true-termination.i_Iteration2_Loop [2019-01-14 03:49:12,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:12,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:12,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:12,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:12,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:12,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:12,993 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:12,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:49:12,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:12,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:12,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:12,998 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:49:12,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:13,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:49:13,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:13,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:49:13,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:49:13,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:13,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:13,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:13,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:13,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:13,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:13,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:13,034 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:13,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:49:13,055 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:13,057 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:13,057 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:13,059 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:13,060 INFO L520 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 [] [2019-01-14 03:49:13,061 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:13,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:13,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:13,294 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-01-14 03:49:13,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 03:49:13,426 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-01-14 03:49:13,428 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-01-14 03:49:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-14 03:49:13,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 03:49:13,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 03:49:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-14 03:49:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:13,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-01-14 03:49:13,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:49:13,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2019-01-14 03:49:13,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 03:49:13,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 03:49:13,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-14 03:49:13,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:13,447 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 03:49:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-14 03:49:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 03:49:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 03:49:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-14 03:49:13,451 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 03:49:13,452 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 03:49:13,452 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:49:13,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-14 03:49:13,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:49:13,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:13,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:13,457 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:49:13,457 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:49:13,457 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-01-14 03:49:13,458 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-01-14 03:49:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash 29742509, now seen corresponding path program 1 times [2019-01-14 03:49:13,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:13,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:13,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:13,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 61795, now seen corresponding path program 1 times [2019-01-14 03:49:13,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:13,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:13,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:13,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1295854647, now seen corresponding path program 1 times [2019-01-14 03:49:13,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:13,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:13,757 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:13,757 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:13,757 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:13,757 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:13,758 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:13,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:13,758 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:13,758 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:13,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: nest-if3_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 03:49:13,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:13,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:13,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:13,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:14,063 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 03:49:14,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:14,091 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-14 03:49:14,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:14,101 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /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-01-14 03:49:14,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:14,154 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:14,327 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:14,329 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:14,329 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:14,329 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:14,329 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:14,329 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:14,329 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:14,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:14,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:14,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: nest-if3_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 03:49:14,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:14,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:14,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:14,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:14,472 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 03:49:14,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:14,495 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:14,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:49:14,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:14,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:14,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:14,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:14,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:14,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:14,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:14,507 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:14,517 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:14,517 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:14,518 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:14,518 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:14,518 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:14,518 INFO L520 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 [] [2019-01-14 03:49:14,519 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:14,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:14,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:14,631 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-01-14 03:49:14,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 03:49:14,688 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-01-14 03:49:14,689 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-01-14 03:49:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 03:49:14,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 03:49:14,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:14,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 03:49:14,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:14,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 03:49:14,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:14,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-01-14 03:49:14,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:49:14,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2019-01-14 03:49:14,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 03:49:14,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 03:49:14,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-14 03:49:14,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:14,697 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 03:49:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-14 03:49:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-14 03:49:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 03:49:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-14 03:49:14,703 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 03:49:14,703 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 03:49:14,703 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:49:14,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-01-14 03:49:14,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:49:14,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:14,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:14,709 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:49:14,709 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:49:14,709 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-01-14 03:49:14,709 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-01-14 03:49:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1516740677, now seen corresponding path program 1 times [2019-01-14 03:49:14,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:14,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:14,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 61795, now seen corresponding path program 2 times [2019-01-14 03:49:14,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:14,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:14,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2129380705, now seen corresponding path program 1 times [2019-01-14 03:49:14,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:14,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:14,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:49:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:14,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:49:14,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:49:14,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:14,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:14,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:49:14,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 03:49:14,920 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:14,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:14,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:14,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:14,921 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:14,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:14,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:14,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:14,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: nest-if3_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-14 03:49:14,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:14,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:14,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:14,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:15,064 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 03:49:15,086 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:15,086 INFO L412 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-01-14 03:49:15,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:15,090 INFO L163 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:15,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:15,114 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:15,211 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:15,213 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:15,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:15,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:15,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:15,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:15,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:15,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:15,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:15,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: nest-if3_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-14 03:49:15,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:15,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:15,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:15,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:15,343 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:15,344 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:15,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:49:15,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:15,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:15,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:15,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:15,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:15,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:15,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:15,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:49:15,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:49:15,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:15,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:15,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:15,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:15,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:15,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:15,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:15,355 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:15,362 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:15,362 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:15,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:15,363 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:15,363 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:15,363 INFO L520 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-01-14 03:49:15,364 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:15,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:15,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:15,478 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-01-14 03:49:15,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 03:49:15,515 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-01-14 03:49:15,517 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-01-14 03:49:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 03:49:15,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 03:49:15,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:15,518 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:15,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:15,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:15,563 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-01-14 03:49:15,564 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 03:49:15,609 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-01-14 03:49:15,610 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-01-14 03:49:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 03:49:15,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 03:49:15,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:15,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:15,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:15,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:15,698 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-01-14 03:49:15,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 03:49:15,722 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-01-14 03:49:15,724 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-01-14 03:49:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 03:49:15,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 03:49:15,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:15,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-14 03:49:15,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:15,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 03:49:15,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:15,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-01-14 03:49:15,730 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:15,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 03:49:15,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:49:15,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:49:15,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:49:15,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:49:15,731 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:15,731 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:49:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:49:15,733 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-01-14 03:49:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:49:15,734 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:49:15,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:49:15,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:49:15,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:15,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:49:15,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:49:15,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:49:15,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:49:15,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:49:15,736 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:15,736 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:15,736 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:15,736 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:49:15,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:49:15,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:15,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:49:15,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:49:15 BoogieIcfgContainer [2019-01-14 03:49:15,744 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:49:15,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:49:15,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:49:15,745 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:49:15,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:11" (3/4) ... [2019-01-14 03:49:15,749 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:49:15,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:49:15,750 INFO L168 Benchmark]: Toolchain (without parser) took 5183.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 951.4 MB in the beginning and 916.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 190.0 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:15,751 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:49:15,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.10 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:15,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.50 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:49:15,755 INFO L168 Benchmark]: Boogie Preprocessor took 35.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:49:15,755 INFO L168 Benchmark]: RCFGBuilder took 502.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:15,757 INFO L168 Benchmark]: BuchiAutomizer took 4278.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.1 MB in the end (delta: 215.3 MB). Peak memory consumption was 215.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:15,758 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.2 GB. Free memory is still 916.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:49:15,764 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.10 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.50 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 502.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4278.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.1 MB in the end (delta: 215.3 MB). Peak memory consumption was 215.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.2 GB. Free memory is still 916.1 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 4.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. 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.2s 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 smp71 dnf97 smp100 tf106 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...