./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.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-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.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 c27ad91a5bec233234e07a14bfd5505e082df4cd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:31:38,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:31:38,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:31:38,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:31:38,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:31:38,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:31:38,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:31:38,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:31:38,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:31:38,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:31:38,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:31:38,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:31:38,239 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:31:38,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:31:38,241 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:31:38,245 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:31:38,246 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:31:38,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:31:38,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:31:38,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:31:38,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:31:38,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:31:38,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:31:38,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:31:38,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:31:38,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:31:38,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:31:38,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:31:38,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:31:38,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:31:38,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:31:38,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:31:38,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:31:38,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:31:38,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:31:38,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:31:38,278 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:31:38,294 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:31:38,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:31:38,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:31:38,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:31:38,296 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:31:38,296 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:31:38,297 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:31:38,297 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:31:38,298 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:31:38,298 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:31:38,298 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:31:38,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:31:38,298 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:31:38,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:31:38,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:31:38,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:31:38,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:31:38,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:31:38,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:31:38,300 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:31:38,300 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:31:38,301 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:31:38,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:31:38,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:31:38,301 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:31:38,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:31:38,303 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:31:38,303 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:31:38,304 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:31:38,305 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 -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2019-01-01 21:31:38,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:31:38,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:31:38,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:31:38,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:31:38,383 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:31:38,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 21:31:38,458 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0904aed13/7c0d249cc2cc4ebf82d08b067e040d05/FLAGcbd3356a8 [2019-01-01 21:31:38,872 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:31:38,873 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 21:31:38,879 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0904aed13/7c0d249cc2cc4ebf82d08b067e040d05/FLAGcbd3356a8 [2019-01-01 21:31:39,243 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0904aed13/7c0d249cc2cc4ebf82d08b067e040d05 [2019-01-01 21:31:39,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:31:39,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:31:39,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:31:39,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:31:39,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:31:39,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5436dc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39, skipping insertion in model container [2019-01-01 21:31:39,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:31:39,288 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:31:39,492 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:31:39,501 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:31:39,525 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:31:39,546 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:31:39,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39 WrapperNode [2019-01-01 21:31:39,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:31:39,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:31:39,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:31:39,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:31:39,561 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:31:39" (1/1) ... [2019-01-01 21:31:39,566 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:31:39" (1/1) ... [2019-01-01 21:31:39,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:31:39,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:31:39,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:31:39,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:31:39,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:31:39,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:31:39,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:31:39,623 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:31:39,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (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:31:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 21:31:39,774 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 21:31:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 21:31:39,775 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 21:31:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:31:39,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:31:40,048 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:31:40,048 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:31:40,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40 BoogieIcfgContainer [2019-01-01 21:31:40,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:31:40,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:31:40,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:31:40,070 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:31:40,072 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:31:39" (1/3) ... [2019-01-01 21:31:40,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8accb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:31:40, skipping insertion in model container [2019-01-01 21:31:40,074 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (2/3) ... [2019-01-01 21:31:40,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8accb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:31:40, skipping insertion in model container [2019-01-01 21:31:40,078 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40" (3/3) ... [2019-01-01 21:31:40,082 INFO L375 chiAutomizerObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 21:31:40,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:31:40,176 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:31:40,176 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:31:40,176 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:31:40,178 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:31:40,178 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:31:40,178 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:31:40,178 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:31:40,178 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:31:40,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 21:31:40,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:31:40,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:40,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:40,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:31:40,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:31:40,238 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:31:40,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 21:31:40,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:31:40,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:40,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:40,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:31:40,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:31:40,252 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 3#L26true call main_#t~ret5 := g(main_~x~0);< 13#gENTRYtrue [2019-01-01 21:31:40,252 INFO L796 eck$LassoCheckResult]: Loop: 13#gENTRYtrue ~x := #in~x; 9#L19true assume !(~x <= 0); 7#L20true call #t~ret2 := f(~x - 1);< 14#fENTRYtrue ~x := #in~x; 18#L13true assume !(~x <= 0); 15#L14true call #t~ret0 := g(~x);< 13#gENTRYtrue [2019-01-01 21:31:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1583, now seen corresponding path program 1 times [2019-01-01 21:31:40,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1158035901, now seen corresponding path program 1 times [2019-01-01 21:31:40,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash 734553451, now seen corresponding path program 1 times [2019-01-01 21:31:40,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,663 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:40,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:40,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:40,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:40,665 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:31:40,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:40,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:40,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:40,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:31:40,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:40,666 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:40,691 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:31:40,721 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:31:40,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:40,729 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:31:40,736 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:31:40,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:31:40,797 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:31:40,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:40,859 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:31:40,891 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:31:41,111 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:41,111 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) [2019-01-01 21:31:41,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,120 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,136 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#res=0} Honda state: {f_#res=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:31:41,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,175 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,176 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret2=0} Honda state: {g_#t~ret2=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:31:41,203 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,203 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,208 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret3=0} Honda state: {g_#t~ret3=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:31:41,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,235 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#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:31:41,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,256 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:31:41,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,360 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:31:41,362 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:41,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:41,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:41,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:41,363 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:31:41,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:41,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:41,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:31:41,363 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:41,363 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:41,367 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:31:41,382 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:31:41,385 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:31:41,389 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:31:41,395 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:31:41,402 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:31:41,434 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:31:41,522 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:31:41,537 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:31:41,539 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:31:41,639 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:41,645 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:31:41,646 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:31:41,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:41,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:41,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:41,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:41,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:41,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:41,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:41,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:41,657 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:31:41,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:41,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:41,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:41,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:41,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:41,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:41,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:41,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:41,663 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:31:41,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:41,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:41,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:41,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:41,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:41,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:41,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:41,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:41,668 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:31:41,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:41,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:41,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:41,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:41,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:41,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:41,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:41,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:41,674 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:31:41,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:41,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:41,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:41,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:41,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:41,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:41,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:41,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:41,678 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:31:41,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:41,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:41,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:41,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:41,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:41,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:41,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:41,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:41,685 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:31:41,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:41,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:41,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:41,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:41,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:41,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:41,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:41,697 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:31:41,702 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:31:41,703 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:31:41,705 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:31:41,706 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:31:41,706 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:31:41,707 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2019-01-01 21:31:41,708 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:31:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:41,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:41,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:42,569 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:31:42,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:31:42,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 6 states. [2019-01-01 21:31:43,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 6 states. Result 62 states and 81 transitions. Complement of second has 24 states. [2019-01-01 21:31:43,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 21:31:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:31:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2019-01-01 21:31:43,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:31:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:43,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:31:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:43,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-01 21:31:43,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:43,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2019-01-01 21:31:43,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:31:43,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 45 states and 59 transitions. [2019-01-01 21:31:43,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 21:31:43,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 21:31:43,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2019-01-01 21:31:43,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:31:43,254 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2019-01-01 21:31:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2019-01-01 21:31:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-01 21:31:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 21:31:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-01-01 21:31:43,289 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-01-01 21:31:43,290 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-01-01 21:31:43,290 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:31:43,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2019-01-01 21:31:43,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:31:43,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:43,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:43,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:43,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:43,298 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 159#L26 call main_#t~ret5 := g(main_~x~0);< 160#gENTRY ~x := #in~x; 186#L19 assume !(~x <= 0); 168#L20 call #t~ret2 := f(~x - 1);< 173#fENTRY ~x := #in~x; 196#L13 assume !(~x <= 0); 162#L14 call #t~ret0 := g(~x);< 187#gENTRY ~x := #in~x; 177#L19 assume ~x <= 0;#res := 0; 161#gFINAL assume true; 163#gEXIT >#26#return; 171#L14-1 [2019-01-01 21:31:43,299 INFO L796 eck$LassoCheckResult]: Loop: 171#L14-1 call #t~ret1 := g(1 + ~x);< 192#gENTRY ~x := #in~x; 200#L19 assume !(~x <= 0); 191#L20 call #t~ret2 := f(~x - 1);< 181#fENTRY ~x := #in~x; 197#L13 assume !(~x <= 0); 180#L14 call #t~ret0 := g(~x);< 192#gENTRY ~x := #in~x; 200#L19 assume ~x <= 0;#res := 0; 184#gFINAL assume true; 202#gEXIT >#26#return; 171#L14-1 [2019-01-01 21:31:43,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1661600137, now seen corresponding path program 1 times [2019-01-01 21:31:43,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:31:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:31:43,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:31:43,413 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1499912510, now seen corresponding path program 1 times [2019-01-01 21:31:43,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:31:43,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:31:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:31:43,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:31:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:31:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:31:43,484 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-01 21:31:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:43,579 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-01-01 21:31:43,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:31:43,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2019-01-01 21:31:43,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:31:43,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 44 states and 55 transitions. [2019-01-01 21:31:43,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 21:31:43,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 21:31:43,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2019-01-01 21:31:43,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:31:43,589 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-01-01 21:31:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2019-01-01 21:31:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-01 21:31:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 21:31:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-01-01 21:31:43,597 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-01-01 21:31:43,597 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-01-01 21:31:43,598 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:31:43,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2019-01-01 21:31:43,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:31:43,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:43,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:43,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:43,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:43,604 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~x~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 264#L26 call main_#t~ret5 := g(main_~x~0);< 265#gENTRY ~x := #in~x; 288#L19 assume !(~x <= 0); 276#L20 call #t~ret2 := f(~x - 1);< 281#fENTRY ~x := #in~x; 294#L13 assume !(~x <= 0); 269#L14 call #t~ret0 := g(~x);< 291#gENTRY ~x := #in~x; 287#L19 assume !(~x <= 0); 279#L20 call #t~ret2 := f(~x - 1);< 280#fENTRY ~x := #in~x; 306#L13 assume ~x <= 0;#res := 0; 305#fFINAL assume true; 282#fEXIT >#30#return; 272#L20-1 call #t~ret3 := f(~x - 2);< 285#fENTRY ~x := #in~x; 293#L13 assume ~x <= 0;#res := 0; 271#fFINAL assume true; 273#fEXIT >#32#return; 289#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 266#gFINAL assume true; 270#gEXIT >#26#return; 267#L14-1 [2019-01-01 21:31:43,604 INFO L796 eck$LassoCheckResult]: Loop: 267#L14-1 call #t~ret1 := g(1 + ~x);< 297#gENTRY ~x := #in~x; 304#L19 assume !(~x <= 0); 295#L20 call #t~ret2 := f(~x - 1);< 302#fENTRY ~x := #in~x; 300#L13 assume !(~x <= 0); 268#L14 call #t~ret0 := g(~x);< 297#gENTRY ~x := #in~x; 304#L19 assume !(~x <= 0); 295#L20 call #t~ret2 := f(~x - 1);< 302#fENTRY ~x := #in~x; 300#L13 assume ~x <= 0;#res := 0; 301#fFINAL assume true; 307#fEXIT >#30#return; 296#L20-1 call #t~ret3 := f(~x - 2);< 302#fENTRY ~x := #in~x; 300#L13 assume ~x <= 0;#res := 0; 301#fFINAL assume true; 307#fEXIT >#32#return; 289#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; 266#gFINAL assume true; 270#gEXIT >#26#return; 267#L14-1 [2019-01-01 21:31:43,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1603563642, now seen corresponding path program 1 times [2019-01-01 21:31:43,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1170922075, now seen corresponding path program 1 times [2019-01-01 21:31:43,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 878037024, now seen corresponding path program 1 times [2019-01-01 21:31:43,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,013 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-01-01 21:31:44,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:31:44 BoogieIcfgContainer [2019-01-01 21:31:44,723 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:31:44,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:31:44,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:31:44,723 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:31:44,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40" (3/4) ... [2019-01-01 21:31:44,727 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:31:44,788 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:31:44,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:31:44,790 INFO L168 Benchmark]: Toolchain (without parser) took 5542.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.3 MB in the beginning and 878.1 MB in the end (delta: 69.3 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:44,791 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:31:44,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.67 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:44,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.68 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:44,793 INFO L168 Benchmark]: Boogie Preprocessor took 29.71 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:44,794 INFO L168 Benchmark]: RCFGBuilder took 426.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:44,794 INFO L168 Benchmark]: BuchiAutomizer took 4672.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.9 MB in the end (delta: 226.0 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:44,795 INFO L168 Benchmark]: Witness Printer took 65.64 ms. Allocated memory is still 1.2 GB. Free memory was 884.9 MB in the beginning and 878.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:44,801 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 297.67 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.68 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.71 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 426.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4672.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.9 MB in the end (delta: 226.0 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. * Witness Printer took 65.64 ms. Allocated memory is still 1.2 GB. Free memory was 884.9 MB in the beginning and 878.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(x) and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 44 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 3 iterations. TraceHistogramMax:3. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 44 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 22 SDslu, 41 SDs, 0 SdLazy, 81 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 14]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ba9aae8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c2c4595=0, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7379d2f7=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bf14f8f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d9419f6=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46cc3c6=0, NULL=0, x=1, \result=0, \old(x)=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 14]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) Loop: [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...