./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-numeric/rec_counter3_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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-numeric/rec_counter3_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 639f18bc5de28da6eb107c1e55f1eb45909efdef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:36:23,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:36:23,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:36:23,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:36:23,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:36:23,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:36:23,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:36:23,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:36:23,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:36:23,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:36:23,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:36:23,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:36:23,899 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:36:23,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:36:23,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:36:23,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:36:23,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:36:23,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:36:23,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:36:23,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:36:23,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:36:23,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:36:23,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:36:23,915 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:36:23,915 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:36:23,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:36:23,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:36:23,919 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:36:23,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:36:23,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:36:23,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:36:23,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:36:23,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:36:23,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:36:23,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:36:23,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:36:23,925 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:36:23,953 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:36:23,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:36:23,955 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:36:23,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:36:23,955 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:36:23,955 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:36:23,955 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:36:23,955 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:36:23,956 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:36:23,956 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:36:23,956 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:36:23,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:36:23,956 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:36:23,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:36:23,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:36:23,957 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:36:23,957 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:36:23,957 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:36:23,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:36:23,958 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:36:23,958 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:36:23,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:36:23,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:36:23,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:36:23,958 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:36:23,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:36:23,959 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:36:23,959 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:36:23,960 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:36:23,960 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 -> 639f18bc5de28da6eb107c1e55f1eb45909efdef [2019-01-01 21:36:24,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:36:24,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:36:24,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:36:24,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:36:24,032 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:36:24,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/rec_counter3_true-termination_true-no-overflow.c [2019-01-01 21:36:24,104 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf9e5cf6/f6836c4e879541fe8e02f691f7ac2042/FLAG8f526d1b2 [2019-01-01 21:36:24,581 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:36:24,582 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/rec_counter3_true-termination_true-no-overflow.c [2019-01-01 21:36:24,590 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf9e5cf6/f6836c4e879541fe8e02f691f7ac2042/FLAG8f526d1b2 [2019-01-01 21:36:24,921 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf9e5cf6/f6836c4e879541fe8e02f691f7ac2042 [2019-01-01 21:36:24,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:36:24,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:36:24,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:24,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:36:24,933 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:36:24,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:24" (1/1) ... [2019-01-01 21:36:24,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256720a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:24, skipping insertion in model container [2019-01-01 21:36:24,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:24" (1/1) ... [2019-01-01 21:36:24,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:36:24,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:36:25,146 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:25,151 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:36:25,167 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:25,186 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:36:25,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25 WrapperNode [2019-01-01 21:36:25,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:25,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:25,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:36:25,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:36:25,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:25,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:36:25,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:36:25,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:36:25,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (1/1) ... [2019-01-01 21:36:25,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:36:25,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:36:25,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:36:25,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:36:25,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (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-01 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-01-01 21:36:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-01-01 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:36:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:36:25,620 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:36:25,621 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:36:25,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:25 BoogieIcfgContainer [2019-01-01 21:36:25,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:36:25,624 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:36:25,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:36:25,630 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:36:25,631 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:25,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:36:24" (1/3) ... [2019-01-01 21:36:25,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47725f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:25, skipping insertion in model container [2019-01-01 21:36:25,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:25,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:25" (2/3) ... [2019-01-01 21:36:25,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47725f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:25, skipping insertion in model container [2019-01-01 21:36:25,635 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:25,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:25" (3/3) ... [2019-01-01 21:36:25,638 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_counter3_true-termination_true-no-overflow.c [2019-01-01 21:36:25,743 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:36:25,746 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:36:25,747 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:36:25,747 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:36:25,747 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:36:25,747 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:36:25,747 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:36:25,747 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:36:25,747 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:36:25,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-01 21:36:25,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-01 21:36:25,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:25,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:25,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:36:25,813 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:25,813 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:36:25,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-01 21:36:25,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-01 21:36:25,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:25,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:25,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:36:25,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:25,825 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 5#L18true assume !(main_~i~0 <= 0); 9#L20true call main_#t~ret3 := rec(main_~i~0);< 3#recENTRYtrue [2019-01-01 21:36:25,826 INFO L796 eck$LassoCheckResult]: Loop: 3#recENTRYtrue ~a := #in~a; 8#L5true assume !(0 == ~a); 11#L8true call #t~ret0 := rec(~a - 1);< 3#recENTRYtrue [2019-01-01 21:36:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash 51816, now seen corresponding path program 1 times [2019-01-01 21:36:25,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:25,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:25,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash 29959, now seen corresponding path program 1 times [2019-01-01 21:36:25,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:25,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1543650624, now seen corresponding path program 1 times [2019-01-01 21:36:25,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:25,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:25,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:25,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:25,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:26,137 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:26,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:26,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:26,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:26,139 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:26,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:26,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:26,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:26,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_counter3_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:36:26,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:26,141 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:26,165 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-01 21:36:26,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:26,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:26,190 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-01 21:36:26,196 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-01 21:36:26,198 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-01 21:36:26,222 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-01 21:36:26,520 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:36:26,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:26,536 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-01 21:36:26,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:26,543 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:26,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:26,552 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret0=0} Honda state: {rec_#t~ret0=0} 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-01 21:36:26,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:26,575 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:26,579 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:26,579 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~res~0=0} Honda state: {rec_~res~0=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-01 21:36:26,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:26,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:26,613 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:26,613 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~post1=0} Honda state: {rec_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 21:36:26,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:26,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:26,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:26,639 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#res=0} Honda state: {rec_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 21:36:26,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:26,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:26,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:26,667 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~a=0} Honda state: {rec_~a=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) [2019-01-01 21:36:26,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:26,702 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 21:36:26,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:26,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:26,747 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:26,747 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#in~a=-5} Honda state: {rec_#in~a=-5} Generalized eigenvectors: [{rec_#in~a=0}, {rec_#in~a=-1}, {rec_#in~a=0}] Lambdas: [0, 1, 3] 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-01 21:36:26,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:26,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:26,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:26,779 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~rescopy~0=0} Honda state: {rec_~rescopy~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 21:36:26,859 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:26,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:26,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:26,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:26,859 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:26,860 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:26,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:26,860 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:26,860 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_counter3_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-01 21:36:26,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:26,860 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:26,862 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-01 21:36:26,880 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-01 21:36:26,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:26,889 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-01 21:36:26,892 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-01 21:36:26,896 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-01 21:36:26,904 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-01 21:36:26,907 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-01 21:36:26,912 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-01 21:36:26,922 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-01 21:36:26,925 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-01 21:36:26,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:27,004 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-01 21:36:27,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:27,505 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01 21:36:27,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,512 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,512 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 21:36:27,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,537 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,537 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret0=0} Honda state: {rec_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 21:36:27,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,572 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,572 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~post1=0} Honda state: {rec_#t~post1=0} 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-01 21:36:27,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,596 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,596 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=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-01 21:36:27,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,621 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,621 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 21:36:27,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,647 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,647 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#res=0} Honda state: {rec_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~a=0} Honda state: {rec_~a=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,705 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,705 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~i~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,736 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,736 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~rescopy~0=0} Honda state: {rec_~rescopy~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,764 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,764 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~res~0=0} Honda state: {rec_~res~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:27,793 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret4=0} Honda state: {ULTIMATE.start_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:27,815 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:27,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:27,877 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:27,882 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:27,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:27,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:27,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:27,882 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:27,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:27,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:27,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:27,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_counter3_true-termination_true-no-overflow.c_Iteration1_Lasso [2019-01-01 21:36:27,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:27,883 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:27,885 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-01 21:36:27,889 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-01 21:36:27,892 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-01 21:36:27,897 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-01 21:36:27,899 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-01 21:36:27,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:27,961 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-01 21:36:27,990 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-01 21:36:28,019 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-01 21:36:28,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-01 21:36:28,070 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-01 21:36:28,098 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-01 21:36:28,209 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-01 21:36:28,412 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:28,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:28,419 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-01 21:36:28,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,429 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-01 21:36:28,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,432 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-01 21:36:28,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,436 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-01 21:36:28,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,440 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-01 21:36:28,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,444 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-01 21:36:28,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,447 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-01 21:36:28,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,457 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-01 21:36:28,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,463 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-01 21:36:28,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,470 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-01 21:36:28,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,476 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-01 21:36:28,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:28,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:28,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:28,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:28,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:28,483 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-01 21:36:28,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:28,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:28,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:36:28,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:28,496 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 21:36:28,496 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:36:28,661 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:28,712 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:36:28,716 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:36:28,718 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:28,723 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 21:36:28,723 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:28,724 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~a) = 1*rec_#in~a Supporting invariants [1*rec_#in~a >= 0] [2019-01-01 21:36:28,753 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:36:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:28,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:28,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:29,090 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-01 21:36:29,105 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:36:29,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 5 states. [2019-01-01 21:36:29,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 5 states. Result 34 states and 42 transitions. Complement of second has 13 states. [2019-01-01 21:36:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:36:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:36:29,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:36:29,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:29,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:36:29,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:29,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:36:29,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:29,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-01-01 21:36:29,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:36:29,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 22 states and 29 transitions. [2019-01-01 21:36:29,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 21:36:29,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:36:29,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-01-01 21:36:29,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:29,343 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-01 21:36:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-01-01 21:36:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-01 21:36:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:36:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-01-01 21:36:29,376 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 21:36:29,376 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 21:36:29,377 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:36:29,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-01-01 21:36:29,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:36:29,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:29,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:29,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:29,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:36:29,380 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 122#L18 assume !(main_~i~0 <= 0); 116#L20 call main_#t~ret3 := rec(main_~i~0);< 115#recENTRY ~a := #in~a; 118#L5 assume 0 == ~a;#res := 0; 125#recFINAL assume true; 132#recEXIT >#47#return; 123#L20-1 main_~res~1 := main_#t~ret3;havoc main_#t~ret3; 124#L21-2 [2019-01-01 21:36:29,380 INFO L796 eck$LassoCheckResult]: Loop: 124#L21-2 assume !!(main_~res~1 < 1); 124#L21-2 [2019-01-01 21:36:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:29,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1684481175, now seen corresponding path program 1 times [2019-01-01 21:36:29,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:29,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:29,493 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-01 21:36:29,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:36:29,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:36:29,497 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:36:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2019-01-01 21:36:29,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:29,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:36:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:36:29,515 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 21:36:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:29,595 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-01 21:36:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:36:29,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-01-01 21:36:29,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:36:29,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 20 transitions. [2019-01-01 21:36:29,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:36:29,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:36:29,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-01-01 21:36:29,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:29,601 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 21:36:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-01-01 21:36:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 21:36:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:36:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-01 21:36:29,604 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 21:36:29,604 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 21:36:29,604 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:36:29,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-01 21:36:29,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:36:29,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:29,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:29,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:29,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:36:29,606 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 171#L18 assume !(main_~i~0 <= 0); 166#L20 call main_#t~ret3 := rec(main_~i~0);< 165#recENTRY ~a := #in~a; 167#L5 assume !(0 == ~a); 169#L8 call #t~ret0 := rec(~a - 1);< 168#recENTRY ~a := #in~a; 170#L5 assume 0 == ~a;#res := 0; 174#recFINAL assume true; 180#recEXIT >#45#return; 179#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 176#L10-2 [2019-01-01 21:36:29,606 INFO L796 eck$LassoCheckResult]: Loop: 176#L10-2 assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; 176#L10-2 [2019-01-01 21:36:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:29,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1511241834, now seen corresponding path program 1 times [2019-01-01 21:36:29,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:29,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:29,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:29,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 46, now seen corresponding path program 1 times [2019-01-01 21:36:29,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:29,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash -396143387, now seen corresponding path program 1 times [2019-01-01 21:36:29,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:29,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:29,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:29,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:36:29,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:36:29,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:36:29,751 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:29,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:29,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:29,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:29,751 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:29,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:29,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:29,752 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:29,752 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_counter3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:29,752 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:29,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:29,753 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-01 21:36:29,764 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-01 21:36:29,811 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:29,812 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:29,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:29,816 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:29,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:29,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:29,864 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:29,865 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:29,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:29,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:29,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:29,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:29,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:29,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:29,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:29,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_counter3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:29,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:29,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:29,868 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-01 21:36:29,870 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-01 21:36:29,945 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:29,946 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:29,946 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-01 21:36:29,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:29,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:29,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:29,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:29,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:29,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:29,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:29,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:29,950 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-01 21:36:29,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:29,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:29,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:29,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:29,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:29,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:29,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:29,954 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:29,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:29,956 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:29,956 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:29,956 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:29,956 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:29,957 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_~rescopy~0) = 1*rec_~rescopy~0 Supporting invariants [] [2019-01-01 21:36:29,957 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:30,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:30,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:30,081 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-01 21:36:30,081 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:36:30,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:36:30,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 37 states and 49 transitions. Complement of second has 10 states. [2019-01-01 21:36:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:36:30,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 1 letters. [2019-01-01 21:36:30,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:30,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 1 letters. [2019-01-01 21:36:30,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:30,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:36:30,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:30,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2019-01-01 21:36:30,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:36:30,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 41 transitions. [2019-01-01 21:36:30,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 21:36:30,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:36:30,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2019-01-01 21:36:30,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:30,162 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-01 21:36:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2019-01-01 21:36:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-01 21:36:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 21:36:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-01-01 21:36:30,167 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-01 21:36:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:36:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:36:30,168 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 5 states. [2019-01-01 21:36:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:30,202 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-01 21:36:30,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:36:30,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2019-01-01 21:36:30,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:36:30,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2019-01-01 21:36:30,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:36:30,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:36:30,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-01-01 21:36:30,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:30,210 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 21:36:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-01-01 21:36:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 21:36:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 21:36:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-01-01 21:36:30,215 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 21:36:30,215 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 21:36:30,216 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:36:30,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2019-01-01 21:36:30,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-01 21:36:30,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:30,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:30,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:30,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:36:30,218 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 354#L18 assume !(main_~i~0 <= 0); 347#L20 call main_#t~ret3 := rec(main_~i~0);< 346#recENTRY ~a := #in~a; 348#L5 assume !(0 == ~a); 350#L8 call #t~ret0 := rec(~a - 1);< 349#recENTRY ~a := #in~a; 353#L5 assume 0 == ~a;#res := 0; 355#recFINAL assume true; 366#recEXIT >#45#return; 373#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 358#L10-2 assume !(~rescopy~0 > 0); 359#L10-3 #res := 1 + ~res~0; 374#recFINAL assume true; 367#recEXIT >#47#return; 356#L20-1 main_~res~1 := main_#t~ret3;havoc main_#t~ret3; 357#L21-2 [2019-01-01 21:36:30,218 INFO L796 eck$LassoCheckResult]: Loop: 357#L21-2 assume !!(main_~res~1 < 1); 357#L21-2 [2019-01-01 21:36:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:30,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1423892654, now seen corresponding path program 1 times [2019-01-01 21:36:30,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:30,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:30,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:30,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2019-01-01 21:36:30,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:30,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:30,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:30,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1190999276, now seen corresponding path program 1 times [2019-01-01 21:36:30,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:30,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:36:30,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:36:30,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:36:30,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:30,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:36:30,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:36:30,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2019-01-01 21:36:30,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:36:30,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:36:30,560 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-01-01 21:36:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:30,649 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-01 21:36:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:36:30,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-01-01 21:36:30,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:36:30,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 26 transitions. [2019-01-01 21:36:30,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 21:36:30,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:36:30,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2019-01-01 21:36:30,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:30,655 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-01 21:36:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2019-01-01 21:36:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-01-01 21:36:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:36:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-01 21:36:30,658 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:36:30,658 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:36:30,658 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:36:30,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-01-01 21:36:30,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:36:30,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:30,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:30,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:30,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:36:30,660 INFO L794 eck$LassoCheckResult]: Stem: 482#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~i~0, main_~res~1;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2; 483#L18 assume !(main_~i~0 <= 0); 473#L20 call main_#t~ret3 := rec(main_~i~0);< 472#recENTRY ~a := #in~a; 474#L5 assume !(0 == ~a); 477#L8 call #t~ret0 := rec(~a - 1);< 475#recENTRY ~a := #in~a; 478#L5 assume !(0 == ~a); 476#L8 call #t~ret0 := rec(~a - 1);< 475#recENTRY ~a := #in~a; 479#L5 assume 0 == ~a;#res := 0; 488#recFINAL assume true; 490#recEXIT >#45#return; 489#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 480#L10-2 assume !(~rescopy~0 > 0); 481#L10-3 #res := 1 + ~res~0; 486#recFINAL assume true; 487#recEXIT >#45#return; 484#L8-1 ~res~0 := #t~ret0;havoc #t~ret0;~rescopy~0 := ~res~0; 485#L10-2 [2019-01-01 21:36:30,660 INFO L796 eck$LassoCheckResult]: Loop: 485#L10-2 assume !!(~rescopy~0 > 0);#t~post1 := ~rescopy~0;~rescopy~0 := #t~post1 - 1;havoc #t~post1; 485#L10-2 [2019-01-01 21:36:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -274003163, now seen corresponding path program 1 times [2019-01-01 21:36:30,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:30,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:30,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:30,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:30,680 INFO L82 PathProgramCache]: Analyzing trace with hash 46, now seen corresponding path program 2 times [2019-01-01 21:36:30,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:30,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:30,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:30,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash 95836554, now seen corresponding path program 1 times [2019-01-01 21:36:30,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:30,755 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:30,755 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:30,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:30,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:30,756 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:30,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:30,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:30,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:30,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_counter3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:36:30,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:30,757 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:30,758 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-01 21:36:30,826 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-01 21:36:30,865 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:30,865 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:30,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:30,875 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:30,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:30,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:30,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:30,921 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:30,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:30,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:30,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:30,921 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:30,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:30,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:30,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:30,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_counter3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:36:30,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:30,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:30,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:30,927 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-01 21:36:30,952 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:30,952 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:30,953 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-01 21:36:30,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:30,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:30,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:30,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:30,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:30,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:30,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:30,957 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:30,959 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:30,959 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:30,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:30,959 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:30,960 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:30,960 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_~rescopy~0) = 1*rec_~rescopy~0 Supporting invariants [] [2019-01-01 21:36:30,960 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:31,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:31,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:31,154 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-01 21:36:31,154 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:36:31,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:36:31,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 7 states. [2019-01-01 21:36:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:36:31,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 19 letters. Loop has 1 letters. [2019-01-01 21:36:31,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:31,203 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:36:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:31,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:31,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:31,315 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-01 21:36:31,315 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:36:31,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:36:31,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 7 states. [2019-01-01 21:36:31,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:36:31,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 19 letters. Loop has 1 letters. [2019-01-01 21:36:31,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:31,350 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:36:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:31,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:31,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:31,606 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-01 21:36:31,606 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:36:31,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:36:31,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 32 states and 40 transitions. Complement of second has 9 states. [2019-01-01 21:36:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:36:31,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 1 letters. [2019-01-01 21:36:31,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:31,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 20 letters. Loop has 1 letters. [2019-01-01 21:36:31,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:31,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters. [2019-01-01 21:36:31,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:31,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-01-01 21:36:31,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:36:31,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-01 21:36:31,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:36:31,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:36:31,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:36:31,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:36:31,670 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:31,670 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:31,670 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:31,670 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:36:31,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:36:31,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:36:31,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:36:31,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:36:31 BoogieIcfgContainer [2019-01-01 21:36:31,682 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:36:31,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:36:31,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:36:31,682 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:36:31,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:25" (3/4) ... [2019-01-01 21:36:31,687 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:36:31,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:36:31,689 INFO L168 Benchmark]: Toolchain (without parser) took 6762.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:31,690 INFO L168 Benchmark]: CDTParser took 0.19 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-01 21:36:31,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:31,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.61 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:31,693 INFO L168 Benchmark]: Boogie Preprocessor took 21.71 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:31,693 INFO L168 Benchmark]: RCFGBuilder took 376.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:31,695 INFO L168 Benchmark]: BuchiAutomizer took 6058.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:31,697 INFO L168 Benchmark]: Witness Printer took 5.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:31,701 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.19 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 258.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 35.61 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.71 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6058.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(a) and consists of 5 locations. One deterministic module has affine ranking function rescopy and consists of 4 locations. One nondeterministic module has affine ranking function rescopy and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 101 SDtfs, 94 SDslu, 159 SDs, 0 SdLazy, 100 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT1 SILN1 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf94 smp100 dnf124 smp100 tf108 neg97 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 240ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...