./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/LogAG_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/LogAG_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 81a46fe8790e1f522cb67a9c253c8a7e6828f982 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:19:15,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:19:15,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:19:15,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:19:15,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:19:15,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:19:15,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:19:15,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:19:15,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:19:15,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:19:15,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:19:15,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:19:15,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:19:15,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:19:15,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:19:15,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:19:15,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:19:15,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:19:15,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:19:15,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:19:15,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:19:15,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:19:15,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:19:15,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:19:15,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:19:15,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:19:15,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:19:15,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:19:15,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:19:15,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:19:15,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:19:15,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:19:15,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:19:15,788 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:19:15,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:19:15,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:19:15,793 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:19:15,824 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:19:15,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:19:15,829 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:19:15,829 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:19:15,830 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:19:15,831 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:19:15,831 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:19:15,831 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:19:15,831 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:19:15,832 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:19:15,833 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:19:15,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:19:15,834 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:19:15,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:19:15,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:19:15,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:19:15,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:19:15,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:19:15,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:19:15,836 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:19:15,836 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:19:15,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:19:15,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:19:15,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:19:15,837 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:19:15,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:19:15,838 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:19:15,838 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:19:15,840 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:19:15,840 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81a46fe8790e1f522cb67a9c253c8a7e6828f982 [2019-01-14 02:19:15,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:19:15,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:19:15,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:19:15,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:19:15,925 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:19:15,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/LogAG_true-termination_true-no-overflow.c [2019-01-14 02:19:15,992 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6922bbd82/9e468bf9c5bc4613af21d2978b8b727c/FLAG72f9dc3eb [2019-01-14 02:19:16,446 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:19:16,447 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/LogAG_true-termination_true-no-overflow.c [2019-01-14 02:19:16,454 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6922bbd82/9e468bf9c5bc4613af21d2978b8b727c/FLAG72f9dc3eb [2019-01-14 02:19:16,827 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6922bbd82/9e468bf9c5bc4613af21d2978b8b727c [2019-01-14 02:19:16,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:19:16,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:19:16,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:16,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:19:16,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:19:16,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:16" (1/1) ... [2019-01-14 02:19:16,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16471161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:16, skipping insertion in model container [2019-01-14 02:19:16,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:16" (1/1) ... [2019-01-14 02:19:16,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:19:16,873 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:19:17,116 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:17,122 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:19:17,145 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:17,165 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:19:17,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17 WrapperNode [2019-01-14 02:19:17,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:17,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:17,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:19:17,167 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:19:17,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:17,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:19:17,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:19:17,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:19:17,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (1/1) ... [2019-01-14 02:19:17,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:19:17,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:19:17,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:19:17,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:19:17,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (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 02:19:17,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:19:17,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:19:17,599 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:19:17,599 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:19:17,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:17 BoogieIcfgContainer [2019-01-14 02:19:17,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:19:17,602 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:19:17,602 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:19:17,607 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:19:17,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:17,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:19:16" (1/3) ... [2019-01-14 02:19:17,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@441d5718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:17, skipping insertion in model container [2019-01-14 02:19:17,609 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:17,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:17" (2/3) ... [2019-01-14 02:19:17,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@441d5718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:17, skipping insertion in model container [2019-01-14 02:19:17,610 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:17,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:17" (3/3) ... [2019-01-14 02:19:17,613 INFO L375 chiAutomizerObserver]: Analyzing ICFG LogAG_true-termination_true-no-overflow.c [2019-01-14 02:19:17,677 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:19:17,678 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:19:17,679 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:19:17,679 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:19:17,680 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:19:17,680 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:19:17,680 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:19:17,681 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:19:17,681 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:19:17,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:19:17,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:17,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:17,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:17,728 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:17,728 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:17,728 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:19:17,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:19:17,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:17,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:17,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:17,730 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:17,731 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:17,740 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; 6#L13-2true [2019-01-14 02:19:17,741 INFO L796 eck$LassoCheckResult]: Loop: 6#L13-2true assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0 - 2;main_~restmp~0 := 0; 3#L17-2true assume !(main_~xtmp~0 > 1); 10#L17-3true main_~x~0 := 1 + main_~xtmp~0;main_~res~0 := 1 + main_~res~0; 6#L13-2true [2019-01-14 02:19:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:19:17,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:17,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:17,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:19:17,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:17,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:17,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:17,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:17,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:17,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:17,895 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-14 02:19:17,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:17,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:17,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:18,067 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 02:19:18,180 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:18,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:18,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:18,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:18,182 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:18,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:18,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:18,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:18,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: LogAG_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:18,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:18,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:18,210 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 02:19:18,224 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 02:19:18,245 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 02:19:18,280 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 02:19:18,285 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 02:19:18,679 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:19:18,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:18,755 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 02:19:18,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:18,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:18,790 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:18,790 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:18,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:18,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:18,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:18,822 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:19:18,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:18,829 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:18,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:18,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:19,171 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:19,174 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:19,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:19,175 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:19,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:19,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:19,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:19,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:19,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:19,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: LogAG_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:19:19,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:19,176 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:19,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:19,204 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 02:19:19,221 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 02:19:19,224 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 02:19:19,248 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 02:19:19,511 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:19,517 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:19,519 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 02:19:19,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:19,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:19,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:19,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:19,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:19,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:19,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:19,538 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 02:19:19,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:19,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:19,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:19,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:19,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:19,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:19,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:19,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:19,544 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 02:19:19,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:19,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:19,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:19,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:19,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:19,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:19,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:19,559 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 02:19:19,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:19,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:19,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:19,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:19,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:19,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:19,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:19,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:19,570 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 02:19:19,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:19,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:19,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:19,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:19,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:19,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:19,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:19,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:19,608 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:19,609 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:19,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:19,612 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:19,612 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:19,613 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:19:19,615 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:19,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:19,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:19,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:19,775 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 02:19:19,790 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 02:19:19,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-14 02:19:19,898 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 23 states and 35 transitions. Complement of second has 7 states. [2019-01-14 02:19:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 02:19:19,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-14 02:19:19,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:19,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:19:19,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:19,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-14 02:19:19,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:19,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. [2019-01-14 02:19:19,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:19,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:19:19,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:19,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:19:19,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:19:19,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:19,919 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:19:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 02:19:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:19:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-14 02:19:19,945 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:19:19,946 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-14 02:19:19,946 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:19:19,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2019-01-14 02:19:19,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:19,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:19,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:19,947 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:19:19,947 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:19,948 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; 75#L13-2 assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0 - 2;main_~restmp~0 := 0; 71#L17-2 [2019-01-14 02:19:19,948 INFO L796 eck$LassoCheckResult]: Loop: 71#L17-2 assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; 71#L17-2 [2019-01-14 02:19:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:19:19,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:19,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:19,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:19,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:19,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:19:19,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:19,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:19:19,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:19,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:19,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:19,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:19,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:20,035 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:20,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:20,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:20,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:20,036 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:20,036 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:20,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:20,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:20,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: LogAG_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:20,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:20,036 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:20,039 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 02:19:20,044 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 02:19:20,052 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 02:19:20,056 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 02:19:20,485 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:19:20,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:20,638 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:20,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:20,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:20,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:20,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:20,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:20,681 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 02:19:20,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:20,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:20,726 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:20,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~restmp~0=0} Honda state: {ULTIMATE.start_main_~restmp~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~restmp~0=0}, {ULTIMATE.start_main_~restmp~0=-5}, {ULTIMATE.start_main_~restmp~0=6}] Lambdas: [0, 1, 1] Nus: [0, 0] 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 02:19:20,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:20,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:20,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:20,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:20,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:20,785 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:20,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:20,812 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:20,838 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:20,840 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:20,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:20,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:20,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:20,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:20,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:20,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:20,841 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:20,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: LogAG_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:20,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:20,841 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:20,843 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 02:19:20,849 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 02:19:20,858 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 02:19:20,863 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 02:19:21,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:21,038 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:21,038 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 02:19:21,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:21,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:21,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:21,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:21,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:21,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:21,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:21,048 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 02:19:21,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:21,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:21,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:21,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:21,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:21,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:21,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:21,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:21,055 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 02:19:21,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:21,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:21,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:21,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:21,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:21,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:21,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:21,064 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 02:19:21,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:21,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:21,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:21,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:21,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:21,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:21,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:21,071 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:21,075 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:21,076 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:21,076 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:21,076 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:21,077 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:21,077 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-14 02:19:21,077 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:21,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:21,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:21,142 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 02:19:21,143 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:19:21,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-14 02:19:21,182 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 13 states and 18 transitions. Complement of second has 5 states. [2019-01-14 02:19:21,184 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 02:19:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:21,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-14 02:19:21,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:21,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:19:21,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:21,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:19:21,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:21,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-14 02:19:21,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:21,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2019-01-14 02:19:21,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:21,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:19:21,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:19:21,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:21,189 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:19:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:19:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-01-14 02:19:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:19:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-14 02:19:21,191 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:19:21,191 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-01-14 02:19:21,191 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:19:21,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2019-01-14 02:19:21,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:21,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:21,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:21,192 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-14 02:19:21,192 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:21,193 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; 123#L13-2 assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0 - 2;main_~restmp~0 := 0; 120#L17-2 assume !(main_~xtmp~0 > 1); 121#L17-3 main_~x~0 := 1 + main_~xtmp~0;main_~res~0 := 1 + main_~res~0; 124#L13-2 assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0 - 2;main_~restmp~0 := 0; 119#L17-2 [2019-01-14 02:19:21,193 INFO L796 eck$LassoCheckResult]: Loop: 119#L17-2 assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; 119#L17-2 [2019-01-14 02:19:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2019-01-14 02:19:21,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:21,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:19:21,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:21,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:21,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash 925896921, now seen corresponding path program 1 times [2019-01-14 02:19:21,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:21,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:21,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:21,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:21,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:19:21,332 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:21,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:21,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:21,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:21,333 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:21,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:21,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:21,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: LogAG_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:21,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:21,334 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:21,336 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 02:19:21,353 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 02:19:21,357 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 02:19:21,369 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 02:19:21,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:21,467 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:21,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:21,495 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:21,496 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:21,501 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:21,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:21,523 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:21,530 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:21,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:21,591 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:21,593 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:21,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:21,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:21,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:21,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:21,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:21,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:21,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: LogAG_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:21,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:21,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:21,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:21,607 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 02:19:21,617 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 02:19:21,655 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 02:19:21,779 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:21,780 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:21,781 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 02:19:21,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:21,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:21,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:21,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:21,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:21,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:21,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:21,790 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 02:19:21,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:21,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:21,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:21,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:21,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:21,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:21,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:21,795 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:21,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:21,798 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:21,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:21,799 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:21,799 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:21,799 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-14 02:19:21,800 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:21,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:21,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:21,873 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 02:19:21,874 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:19:21,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:19:21,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:19:21,893 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 02:19:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:21,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:19:21,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:21,895 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:21,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:21,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:21,926 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 02:19:21,927 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:19:21,927 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:19:21,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:19:21,959 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 02:19:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:21,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:19:21,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:21,961 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:22,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:22,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:22,039 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 02:19:22,040 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 1 loop predicates [2019-01-14 02:19:22,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:19:22,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 4 states. [2019-01-14 02:19:22,066 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 02:19:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:19:22,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:19:22,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:22,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:22,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:22,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:19:22,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:22,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 02:19:22,070 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:22,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 02:19:22,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:22,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:22,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:22,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:22,071 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:22,071 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:22,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:19:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:19:22,076 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 02:19:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:22,080 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:19:22,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:19:22,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:19:22,080 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:22,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:19:22,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:22,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:22,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:22,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:22,081 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:22,081 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:22,081 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:22,081 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:19:22,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:19:22,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:22,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:19:22,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:19:22 BoogieIcfgContainer [2019-01-14 02:19:22,090 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:19:22,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:19:22,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:19:22,091 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:19:22,092 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:17" (3/4) ... [2019-01-14 02:19:22,095 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:19:22,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:19:22,097 INFO L168 Benchmark]: Toolchain (without parser) took 5263.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 947.3 MB in the beginning and 883.2 MB in the end (delta: 64.2 MB). Peak memory consumption was 194.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:22,098 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:22,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 02:19:22,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.48 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:22,100 INFO L168 Benchmark]: Boogie Preprocessor took 30.06 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:22,100 INFO L168 Benchmark]: RCFGBuilder took 351.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:22,101 INFO L168 Benchmark]: BuchiAutomizer took 4488.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.2 MB in the end (delta: 232.1 MB). Peak memory consumption was 232.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:22,102 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 883.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:22,107 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 50.48 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.06 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 351.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4488.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 883.2 MB in the end (delta: 232.1 MB). Peak memory consumption was 232.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 883.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function xtmp and consists of 3 locations. One nondeterministic module has affine ranking function xtmp and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 23 SDslu, 6 SDs, 0 SdLazy, 35 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax168 hnf99 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf93 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 1 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...