./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer --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 cb528549fa76ae8087cf7043645dfa20323a0116 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:05:33,041 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:05:33,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:05:33,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:05:33,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:05:33,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:05:33,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:05:33,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:05:33,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:05:33,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:05:33,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:05:33,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:05:33,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:05:33,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:05:33,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:05:33,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:05:33,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:05:33,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:05:33,060 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:05:33,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:05:33,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:05:33,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:05:33,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:05:33,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:05:33,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:05:33,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:05:33,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:05:33,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:05:33,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:05:33,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:05:33,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:05:33,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:05:33,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:05:33,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:05:33,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:05:33,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:05:33,070 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:05:33,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:05:33,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:05:33,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:05:33,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:05:33,082 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:05:33,082 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:05:33,082 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:05:33,082 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:05:33,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:05:33,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:05:33,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:05:33,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:05:33,084 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:05:33,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:05:33,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:05:33,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:05:33,084 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:05:33,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:05:33,085 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:05:33,085 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:05:33,085 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:05:33,086 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer 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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2018-11-10 05:05:33,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:05:33,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:05:33,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:05:33,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:05:33,120 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:05:33,120 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 05:05:33,157 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/data/a5d0072e5/4b12c9fbeccc4663bc9eb742bd75c7c4/FLAG0bb447f92 [2018-11-10 05:05:33,549 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:05:33,550 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 05:05:33,553 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/data/a5d0072e5/4b12c9fbeccc4663bc9eb742bd75c7c4/FLAG0bb447f92 [2018-11-10 05:05:33,564 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/data/a5d0072e5/4b12c9fbeccc4663bc9eb742bd75c7c4 [2018-11-10 05:05:33,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:05:33,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:05:33,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:05:33,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:05:33,571 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:05:33,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ed4351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33, skipping insertion in model container [2018-11-10 05:05:33,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:05:33,589 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:05:33,680 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:05:33,683 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:05:33,691 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:05:33,699 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:05:33,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33 WrapperNode [2018-11-10 05:05:33,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:05:33,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:05:33,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:05:33,700 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:05:33,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:05:33,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:05:33,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:05:33,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:05:33,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... [2018-11-10 05:05:33,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:05:33,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:05:33,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:05:33,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:05:33,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-10 05:05:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-10 05:05:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-10 05:05:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-10 05:05:33,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:05:33,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:05:33,924 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:05:33,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:05:33 BoogieIcfgContainer [2018-11-10 05:05:33,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:05:33,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:05:33,925 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:05:33,927 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:05:33,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:05:33,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:05:33" (1/3) ... [2018-11-10 05:05:33,928 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c40fc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:05:33, skipping insertion in model container [2018-11-10 05:05:33,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:05:33,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:05:33" (2/3) ... [2018-11-10 05:05:33,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c40fc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:05:33, skipping insertion in model container [2018-11-10 05:05:33,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:05:33,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:05:33" (3/3) ... [2018-11-10 05:05:33,931 INFO L375 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 05:05:33,968 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:05:33,968 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:05:33,968 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:05:33,968 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:05:33,969 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:05:33,969 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:05:33,969 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:05:33,969 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:05:33,969 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:05:33,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 05:05:33,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:33,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:33,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:34,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 05:05:34,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:34,006 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:05:34,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 05:05:34,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:34,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:34,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:34,008 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 05:05:34,008 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:34,014 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 23#L25true call main_#t~ret6 := rec2(main_~x~0);< 3#rec2ENTRYtrue [2018-11-10 05:05:34,014 INFO L795 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 21#L18true assume !(~j <= 0); 19#L20true call #t~ret3 := rec1(~j - 1);< 4#rec1ENTRYtrue ~i := #in~i; 9#L12true assume ~i <= 0;#res := 0; 5#rec1FINALtrue assume true; 13#rec1EXITtrue >#34#return; 24#L20-1true call #t~ret4 := rec2(#t~ret3);< 3#rec2ENTRYtrue [2018-11-10 05:05:34,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash 48738, now seen corresponding path program 1 times [2018-11-10 05:05:34,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:34,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:34,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1074209557, now seen corresponding path program 1 times [2018-11-10 05:05:34,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:34,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:34,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:34,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:34,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:34,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1203131828, now seen corresponding path program 1 times [2018-11-10 05:05:34,096 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:34,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:34,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:34,285 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:34,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:34,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:34,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:34,287 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:05:34,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:34,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:34,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:34,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-10 05:05:34,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:34,287 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:34,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,376 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:34,376 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:34,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:34,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:34,388 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:34,388 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:34,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:34,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:34,407 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:34,407 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:34,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:34,425 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:34,427 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:34,428 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:34,444 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:34,444 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:34,450 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:34,450 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:34,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:34,474 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:34,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:05:34,491 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:34,495 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:05:34,509 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:34,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:34,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:34,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:34,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:05:34,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:34,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:34,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:34,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-10 05:05:34,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:34,510 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:34,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:34,548 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:34,552 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:05:34,553 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 [2018-11-10 05:05:34,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:34,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:34,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:34,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:34,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:34,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:34,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:34,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:34,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:05:34,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:34,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:34,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:34,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:34,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:34,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:34,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:34,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:34,562 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 [2018-11-10 05:05:34,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:34,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:34,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:34,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:34,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:34,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:34,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:34,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:34,565 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 [2018-11-10 05:05:34,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:34,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:34,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:34,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:34,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:34,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:34,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:34,571 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:05:34,574 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:05:34,574 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:05:34,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:05:34,576 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:05:34,576 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:05:34,576 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2018-11-10 05:05:34,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:05:34,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:34,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:34,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:34,704 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:05:34,705 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 7 states. [2018-11-10 05:05:35,066 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 7 states. Result 195 states and 280 transitions. Complement of second has 61 states. [2018-11-10 05:05:35,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 05:05:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:05:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-10 05:05:35,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 05:05:35,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 05:05:35,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 3 letters. Loop has 16 letters. [2018-11-10 05:05:35,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 280 transitions. [2018-11-10 05:05:35,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:35,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 83 states and 121 transitions. [2018-11-10 05:05:35,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 05:05:35,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-10 05:05:35,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 121 transitions. [2018-11-10 05:05:35,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:35,097 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 121 transitions. [2018-11-10 05:05:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 121 transitions. [2018-11-10 05:05:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-11-10 05:05:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 05:05:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2018-11-10 05:05:35,126 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2018-11-10 05:05:35,126 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2018-11-10 05:05:35,127 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:05:35,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 84 transitions. [2018-11-10 05:05:35,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:35,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:35,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:35,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:35,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:05:35,130 INFO L793 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 350#L25 call main_#t~ret6 := rec2(main_~x~0);< 349#rec2ENTRY ~j := #in~j; 352#L18 assume !(~j <= 0); 382#L20 call #t~ret3 := rec1(~j - 1);< 396#rec1ENTRY ~i := #in~i; 381#L12 assume !(~i <= 0); 358#L14 call #t~ret0 := rec1(~i - 2);< 355#rec1ENTRY [2018-11-10 05:05:35,131 INFO L795 eck$LassoCheckResult]: Loop: 355#rec1ENTRY ~i := #in~i; 363#L12 assume !(~i <= 0); 361#L14 call #t~ret0 := rec1(~i - 2);< 355#rec1ENTRY [2018-11-10 05:05:35,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 838970620, now seen corresponding path program 1 times [2018-11-10 05:05:35,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2018-11-10 05:05:35,140 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1359045147, now seen corresponding path program 2 times [2018-11-10 05:05:35,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:35,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,204 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:35,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:35,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:35,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:35,204 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:05:35,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:35,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:35,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:35,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-10 05:05:35,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:35,205 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:35,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,257 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:35,257 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,270 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:35,270 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,290 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:35,290 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,308 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:35,308 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,326 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:35,327 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,345 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:35,345 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,371 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:05:35,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,408 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:05:35,408 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:35,409 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:35,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:35,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:35,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:05:35,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:35,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:35,409 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:35,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-10 05:05:35,409 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:35,410 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:35,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,438 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:35,438 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:05:35,439 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 [2018-11-10 05:05:35,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:35,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:35,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:35,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:35,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:35,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:35,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:35,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:35,442 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 [2018-11-10 05:05:35,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:35,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:35,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:35,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:35,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:35,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:35,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:35,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:35,445 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 [2018-11-10 05:05:35,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:35,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:35,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:35,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:35,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:35,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:35,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:35,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:35,448 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 [2018-11-10 05:05:35,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:35,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:35,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:35,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:35,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:35,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:35,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:35,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:35,450 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 [2018-11-10 05:05:35,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:35,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:35,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:35,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:35,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:35,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:35,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:35,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:05:35,457 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 05:05:35,457 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:05:35,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:05:35,458 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:05:35,458 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:05:35,458 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2018-11-10 05:05:35,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:05:35,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:35,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:35,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:35,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:05:35,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 32 Second operand 4 states. [2018-11-10 05:05:35,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 32. Second operand 4 states. Result 106 states and 150 transitions. Complement of second has 13 states. [2018-11-10 05:05:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:05:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:05:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 05:05:35,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 05:05:35,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 05:05:35,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 05:05:35,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 150 transitions. [2018-11-10 05:05:35,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:35,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 94 states and 138 transitions. [2018-11-10 05:05:35,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 05:05:35,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 05:05:35,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 138 transitions. [2018-11-10 05:05:35,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:35,547 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 138 transitions. [2018-11-10 05:05:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 138 transitions. [2018-11-10 05:05:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-11-10 05:05:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 05:05:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2018-11-10 05:05:35,554 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2018-11-10 05:05:35,554 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2018-11-10 05:05:35,554 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:05:35,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 130 transitions. [2018-11-10 05:05:35,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:35,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:35,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:35,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:35,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:05:35,556 INFO L793 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 581#L25 call main_#t~ret6 := rec2(main_~x~0);< 580#rec2ENTRY ~j := #in~j; 582#L18 assume !(~j <= 0); 588#L20 call #t~ret3 := rec1(~j - 1);< 587#rec1ENTRY ~i := #in~i; 589#L12 assume !(~i <= 0); 614#L14 call #t~ret0 := rec1(~i - 2);< 629#rec1ENTRY ~i := #in~i; 647#L12 assume ~i <= 0;#res := 0; 645#rec1FINAL assume true; 626#rec1EXIT >#28#return; 600#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 602#rec1ENTRY [2018-11-10 05:05:35,557 INFO L795 eck$LassoCheckResult]: Loop: 602#rec1ENTRY ~i := #in~i; 644#L12 assume !(~i <= 0); 617#L14 call #t~ret0 := rec1(~i - 2);< 602#rec1ENTRY [2018-11-10 05:05:35,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,557 INFO L82 PathProgramCache]: Analyzing trace with hash 372282091, now seen corresponding path program 1 times [2018-11-10 05:05:35,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2018-11-10 05:05:35,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1050214860, now seen corresponding path program 2 times [2018-11-10 05:05:35,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:35,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:05:35,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:05:35,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 05:05:35,637 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:35,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:35,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:35,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:35,637 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:05:35,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:35,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:35,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:35,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-10 05:05:35,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:35,638 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:35,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,669 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:35,669 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,673 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:35,673 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:35,702 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:35,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:05:35,726 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:35,743 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:05:35,744 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:35,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:35,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:35,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:35,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:05:35,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:35,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:35,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:35,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-10 05:05:35,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:35,745 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:35,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:35,772 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:35,773 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:05:35,773 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 [2018-11-10 05:05:35,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:35,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:35,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:35,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:35,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:35,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:35,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:35,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:35,775 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 [2018-11-10 05:05:35,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:35,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:35,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:35,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:35,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:35,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:35,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:35,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:05:35,781 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 05:05:35,781 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:05:35,781 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:05:35,781 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:05:35,782 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:05:35,782 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2018-11-10 05:05:35,782 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:05:35,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:35,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:35,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:35,835 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 [2018-11-10 05:05:35,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 130 transitions. cyclomatic complexity: 47 Second operand 5 states. [2018-11-10 05:05:35,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 130 transitions. cyclomatic complexity: 47. Second operand 5 states. Result 135 states and 194 transitions. Complement of second has 14 states. [2018-11-10 05:05:35,885 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 [2018-11-10 05:05:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:05:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-10 05:05:35,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-10 05:05:35,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-10 05:05:35,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-10 05:05:35,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:35,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 194 transitions. [2018-11-10 05:05:35,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:35,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 123 states and 182 transitions. [2018-11-10 05:05:35,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 05:05:35,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-10 05:05:35,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 182 transitions. [2018-11-10 05:05:35,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:35,892 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 182 transitions. [2018-11-10 05:05:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 182 transitions. [2018-11-10 05:05:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2018-11-10 05:05:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 05:05:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2018-11-10 05:05:35,899 INFO L728 BuchiCegarLoop]: Abstraction has 114 states and 166 transitions. [2018-11-10 05:05:35,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:05:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:05:35,902 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand 6 states. [2018-11-10 05:05:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:05:35,927 INFO L93 Difference]: Finished difference Result 124 states and 176 transitions. [2018-11-10 05:05:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:05:35,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 176 transitions. [2018-11-10 05:05:35,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 05:05:35,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 122 states and 174 transitions. [2018-11-10 05:05:35,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-10 05:05:35,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-10 05:05:35,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 174 transitions. [2018-11-10 05:05:35,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:35,932 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 174 transitions. [2018-11-10 05:05:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 174 transitions. [2018-11-10 05:05:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2018-11-10 05:05:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 05:05:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2018-11-10 05:05:35,938 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2018-11-10 05:05:35,938 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2018-11-10 05:05:35,938 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:05:35,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 144 transitions. [2018-11-10 05:05:35,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 05:05:35,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:35,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:35,939 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:35,939 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:35,939 INFO L793 eck$LassoCheckResult]: Stem: 1187#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1185#L25 call main_#t~ret6 := rec2(main_~x~0);< 1194#rec2ENTRY ~j := #in~j; 1205#L18 assume !(~j <= 0); 1177#L20 call #t~ret3 := rec1(~j - 1);< 1204#rec1ENTRY ~i := #in~i; 1203#L12 assume !(~i <= 0); 1158#L14 call #t~ret0 := rec1(~i - 2);< 1200#rec1ENTRY ~i := #in~i; 1199#L12 assume !(~i <= 0); 1154#L14 call #t~ret0 := rec1(~i - 2);< 1198#rec1ENTRY ~i := #in~i; 1202#L12 assume ~i <= 0;#res := 0; 1153#rec1FINAL assume true; 1155#rec1EXIT >#28#return; 1147#L14-1 [2018-11-10 05:05:35,940 INFO L795 eck$LassoCheckResult]: Loop: 1147#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1145#rec1ENTRY ~i := #in~i; 1148#L12 assume ~i <= 0;#res := 0; 1181#rec1FINAL assume true; 1233#rec1EXIT >#30#return; 1163#L14-2 call #t~ret2 := rec1(#t~ret1);< 1182#rec1ENTRY ~i := #in~i; 1226#L12 assume !(~i <= 0); 1159#L14 call #t~ret0 := rec1(~i - 2);< 1182#rec1ENTRY ~i := #in~i; 1226#L12 assume ~i <= 0;#res := 0; 1225#rec1FINAL assume true; 1224#rec1EXIT >#28#return; 1147#L14-1 [2018-11-10 05:05:35,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1325197585, now seen corresponding path program 1 times [2018-11-10 05:05:35,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:35,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 949089090, now seen corresponding path program 1 times [2018-11-10 05:05:35,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:35,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:35,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:35,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:05:35,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:05:35,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:05:35,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:36,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:36,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:05:36,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 05:05:36,025 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:05:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:05:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:05:36,025 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-10 05:05:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:05:36,050 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2018-11-10 05:05:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:05:36,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 162 transitions. [2018-11-10 05:05:36,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:36,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 162 transitions. [2018-11-10 05:05:36,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-10 05:05:36,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 05:05:36,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 162 transitions. [2018-11-10 05:05:36,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:36,055 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 162 transitions. [2018-11-10 05:05:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 162 transitions. [2018-11-10 05:05:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-11-10 05:05:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 05:05:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2018-11-10 05:05:36,062 INFO L728 BuchiCegarLoop]: Abstraction has 114 states and 158 transitions. [2018-11-10 05:05:36,062 INFO L608 BuchiCegarLoop]: Abstraction has 114 states and 158 transitions. [2018-11-10 05:05:36,062 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:05:36,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 158 transitions. [2018-11-10 05:05:36,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 05:05:36,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:36,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:36,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:36,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:36,065 INFO L793 eck$LassoCheckResult]: Stem: 1460#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1459#L25 call main_#t~ret6 := rec2(main_~x~0);< 1465#rec2ENTRY ~j := #in~j; 1477#L18 assume !(~j <= 0); 1450#L20 call #t~ret3 := rec1(~j - 1);< 1476#rec1ENTRY ~i := #in~i; 1475#L12 assume !(~i <= 0); 1430#L14 call #t~ret0 := rec1(~i - 2);< 1473#rec1ENTRY ~i := #in~i; 1474#L12 assume ~i <= 0;#res := 0; 1517#rec1FINAL assume true; 1516#rec1EXIT >#28#return; 1505#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1438#rec1ENTRY ~i := #in~i; 1512#L12 assume ~i <= 0;#res := 0; 1511#rec1FINAL assume true; 1504#rec1EXIT >#30#return; 1417#L14-2 call #t~ret2 := rec1(#t~ret1);< 1416#rec1ENTRY ~i := #in~i; 1419#L12 assume ~i <= 0;#res := 0; 1515#rec1FINAL assume true; 1514#rec1EXIT >#32#return; 1449#L14-3 #res := #t~ret2 + 1;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 1452#rec1FINAL assume true; 1470#rec1EXIT >#34#return; 1411#L20-1 [2018-11-10 05:05:36,065 INFO L795 eck$LassoCheckResult]: Loop: 1411#L20-1 call #t~ret4 := rec2(#t~ret3);< 1410#rec2ENTRY ~j := #in~j; 1412#L18 assume !(~j <= 0); 1432#L20 call #t~ret3 := rec1(~j - 1);< 1461#rec1ENTRY ~i := #in~i; 1510#L12 assume !(~i <= 0); 1435#L14 call #t~ret0 := rec1(~i - 2);< 1461#rec1ENTRY ~i := #in~i; 1510#L12 assume ~i <= 0;#res := 0; 1508#rec1FINAL assume true; 1506#rec1EXIT >#28#return; 1429#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1438#rec1ENTRY ~i := #in~i; 1512#L12 assume ~i <= 0;#res := 0; 1511#rec1FINAL assume true; 1504#rec1EXIT >#30#return; 1418#L14-2 call #t~ret2 := rec1(#t~ret1);< 1416#rec1ENTRY ~i := #in~i; 1419#L12 assume ~i <= 0;#res := 0; 1515#rec1FINAL assume true; 1514#rec1EXIT >#32#return; 1469#L14-3 #res := #t~ret2 + 1;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 1481#rec1FINAL assume true; 1468#rec1EXIT >#34#return; 1411#L20-1 [2018-11-10 05:05:36,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:36,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1231361643, now seen corresponding path program 1 times [2018-11-10 05:05:36,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:36,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:36,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:36,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:36,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:36,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1591101301, now seen corresponding path program 1 times [2018-11-10 05:05:36,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:36,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:36,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:36,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:36,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:36,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash 774680821, now seen corresponding path program 1 times [2018-11-10 05:05:36,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:36,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:36,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:05:36,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:05:36,182 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:05:36,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:36,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:05:36,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:05:36,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 05:05:36,385 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:36,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:36,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:36,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:36,385 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:05:36,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:36,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:36,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:36,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-10 05:05:36,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:36,385 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:36,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:36,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:36,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:36,411 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:36,412 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:36,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:36,414 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:36,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:05:36,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:37,458 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:05:37,459 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:37,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:37,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:37,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:37,459 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:05:37,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:37,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:37,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:37,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-10 05:05:37,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:37,460 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:37,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:37,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:37,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:37,494 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:37,494 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:05:37,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:05:37,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:37,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:37,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:37,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:37,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:37,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:37,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:37,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:37,497 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 [2018-11-10 05:05:37,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:37,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:37,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:37,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:37,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:37,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:37,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:37,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:37,499 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 [2018-11-10 05:05:37,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:37,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:37,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:37,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:37,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:37,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:37,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:37,508 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:05:37,511 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:05:37,511 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:05:37,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:05:37,512 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:05:37,512 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:05:37,512 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#t~ret3) = 1*rec2_#t~ret3 Supporting invariants [] [2018-11-10 05:05:37,512 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:05:37,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:37,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:37,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:05:37,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 05:05:37,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 158 transitions. cyclomatic complexity: 51 Second operand 11 states. [2018-11-10 05:05:37,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 158 transitions. cyclomatic complexity: 51. Second operand 11 states. Result 585 states and 904 transitions. Complement of second has 45 states. [2018-11-10 05:05:37,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 05:05:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:05:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2018-11-10 05:05:37,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 26 letters. Loop has 24 letters. [2018-11-10 05:05:37,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:37,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 50 letters. Loop has 24 letters. [2018-11-10 05:05:37,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:37,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 26 letters. Loop has 48 letters. [2018-11-10 05:05:37,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:37,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 585 states and 904 transitions. [2018-11-10 05:05:37,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-10 05:05:37,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 585 states to 433 states and 650 transitions. [2018-11-10 05:05:37,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-11-10 05:05:37,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2018-11-10 05:05:37,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 650 transitions. [2018-11-10 05:05:37,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:37,974 INFO L705 BuchiCegarLoop]: Abstraction has 433 states and 650 transitions. [2018-11-10 05:05:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 650 transitions. [2018-11-10 05:05:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 384. [2018-11-10 05:05:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-11-10 05:05:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 535 transitions. [2018-11-10 05:05:37,995 INFO L728 BuchiCegarLoop]: Abstraction has 384 states and 535 transitions. [2018-11-10 05:05:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:05:37,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:05:37,996 INFO L87 Difference]: Start difference. First operand 384 states and 535 transitions. Second operand 10 states. [2018-11-10 05:05:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:05:38,176 INFO L93 Difference]: Finished difference Result 443 states and 646 transitions. [2018-11-10 05:05:38,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:05:38,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 646 transitions. [2018-11-10 05:05:38,183 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-10 05:05:38,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 350 states and 496 transitions. [2018-11-10 05:05:38,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2018-11-10 05:05:38,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2018-11-10 05:05:38,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 496 transitions. [2018-11-10 05:05:38,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:38,190 INFO L705 BuchiCegarLoop]: Abstraction has 350 states and 496 transitions. [2018-11-10 05:05:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 496 transitions. [2018-11-10 05:05:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 315. [2018-11-10 05:05:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-10 05:05:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 416 transitions. [2018-11-10 05:05:38,203 INFO L728 BuchiCegarLoop]: Abstraction has 315 states and 416 transitions. [2018-11-10 05:05:38,203 INFO L608 BuchiCegarLoop]: Abstraction has 315 states and 416 transitions. [2018-11-10 05:05:38,203 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:05:38,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 416 transitions. [2018-11-10 05:05:38,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-10 05:05:38,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:38,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:38,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:38,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:05:38,208 INFO L793 eck$LassoCheckResult]: Stem: 3393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 3387#L25 call main_#t~ret6 := rec2(main_~x~0);< 3402#rec2ENTRY ~j := #in~j; 3427#L18 assume !(~j <= 0); 3424#L20 call #t~ret3 := rec1(~j - 1);< 3425#rec1ENTRY ~i := #in~i; 3441#L12 assume !(~i <= 0); 3435#L14 call #t~ret0 := rec1(~i - 2);< 3440#rec1ENTRY ~i := #in~i; 3447#L12 assume ~i <= 0;#res := 0; 3475#rec1FINAL assume true; 3474#rec1EXIT >#28#return; 3467#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 3468#rec1ENTRY ~i := #in~i; 3472#L12 assume ~i <= 0;#res := 0; 3471#rec1FINAL assume true; 3466#rec1EXIT >#30#return; 3461#L14-2 call #t~ret2 := rec1(#t~ret1);< 3464#rec1ENTRY ~i := #in~i; 3470#L12 assume ~i <= 0;#res := 0; 3465#rec1FINAL assume true; 3463#rec1EXIT >#32#return; 3459#L14-3 #res := #t~ret2 + 1;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 3497#rec1FINAL assume true; 3494#rec1EXIT >#34#return; 3408#L20-1 call #t~ret4 := rec2(#t~ret3);< 3521#rec2ENTRY ~j := #in~j; 3520#L18 assume !(~j <= 0); 3491#L20 call #t~ret3 := rec1(~j - 1);< 3411#rec1ENTRY ~i := #in~i; 3510#L12 assume !(~i <= 0); 3353#L14 call #t~ret0 := rec1(~i - 2);< 3377#rec1ENTRY [2018-11-10 05:05:38,208 INFO L795 eck$LassoCheckResult]: Loop: 3377#rec1ENTRY ~i := #in~i; 3525#L12 assume !(~i <= 0); 3366#L14 call #t~ret0 := rec1(~i - 2);< 3377#rec1ENTRY [2018-11-10 05:05:38,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1565705522, now seen corresponding path program 2 times [2018-11-10 05:05:38,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:38,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:38,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:38,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:38,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:05:38,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:05:38,261 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:05:38,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:05:38,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:05:38,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:05:38,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:05:38,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:05:38,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 05:05:38,308 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:05:38,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 3 times [2018-11-10 05:05:38,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:38,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:38,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:38,331 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:38,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:38,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:38,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:38,332 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:05:38,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:38,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:38,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:38,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-10 05:05:38,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:38,332 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:38,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,354 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:38,355 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:38,356 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:38,356 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:38,358 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:38,358 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:38,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:38,375 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:38,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:05:38,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:38,411 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:05:38,412 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:38,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:38,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:38,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:38,412 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:05:38,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:38,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:38,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:38,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-10 05:05:38,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:38,412 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:38,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:38,441 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:38,441 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:05:38,442 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 [2018-11-10 05:05:38,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:38,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:38,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:38,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:38,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:38,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:38,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:38,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:38,448 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 [2018-11-10 05:05:38,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:38,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:38,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:38,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:38,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:38,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:38,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:38,451 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:05:38,452 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 05:05:38,452 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:05:38,452 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:05:38,452 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:05:38,452 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:05:38,452 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2018-11-10 05:05:38,452 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:05:38,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:38,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:38,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:38,568 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 [2018-11-10 05:05:38,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114 Second operand 5 states. [2018-11-10 05:05:38,633 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 349 states and 456 transitions. Complement of second has 14 states. [2018-11-10 05:05:38,633 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 [2018-11-10 05:05:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:05:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-10 05:05:38,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 33 letters. Loop has 3 letters. [2018-11-10 05:05:38,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:38,634 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:05:38,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:38,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:38,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:38,718 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 05:05:38,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114 Second operand 5 states. [2018-11-10 05:05:38,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 349 states and 456 transitions. Complement of second has 14 states. [2018-11-10 05:05:38,773 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 [2018-11-10 05:05:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:05:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-10 05:05:38,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 33 letters. Loop has 3 letters. [2018-11-10 05:05:38,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:38,774 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:05:38,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:38,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:38,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:38,861 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 3 loop predicates [2018-11-10 05:05:38,861 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114 Second operand 5 states. [2018-11-10 05:05:38,937 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 486 states and 617 transitions. Complement of second has 16 states. [2018-11-10 05:05:38,941 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 [2018-11-10 05:05:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:05:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-10 05:05:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 3 letters. [2018-11-10 05:05:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 36 letters. Loop has 3 letters. [2018-11-10 05:05:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 6 letters. [2018-11-10 05:05:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:38,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 486 states and 617 transitions. [2018-11-10 05:05:38,948 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 05:05:38,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 486 states to 396 states and 527 transitions. [2018-11-10 05:05:38,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 05:05:38,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-10 05:05:38,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 396 states and 527 transitions. [2018-11-10 05:05:38,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:38,953 INFO L705 BuchiCegarLoop]: Abstraction has 396 states and 527 transitions. [2018-11-10 05:05:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states and 527 transitions. [2018-11-10 05:05:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 352. [2018-11-10 05:05:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-10 05:05:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 457 transitions. [2018-11-10 05:05:38,963 INFO L728 BuchiCegarLoop]: Abstraction has 352 states and 457 transitions. [2018-11-10 05:05:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:05:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:05:38,964 INFO L87 Difference]: Start difference. First operand 352 states and 457 transitions. Second operand 10 states. [2018-11-10 05:05:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:05:39,206 INFO L93 Difference]: Finished difference Result 379 states and 514 transitions. [2018-11-10 05:05:39,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:05:39,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 514 transitions. [2018-11-10 05:05:39,213 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:05:39,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 105 states and 143 transitions. [2018-11-10 05:05:39,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2018-11-10 05:05:39,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-11-10 05:05:39,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-10 05:05:39,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:39,216 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-10 05:05:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-10 05:05:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2018-11-10 05:05:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 05:05:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2018-11-10 05:05:39,220 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2018-11-10 05:05:39,220 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2018-11-10 05:05:39,220 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:05:39,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 107 transitions. [2018-11-10 05:05:39,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:05:39,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:39,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:39,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:39,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:05:39,221 INFO L793 eck$LassoCheckResult]: Stem: 6115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 6114#L25 call main_#t~ret6 := rec2(main_~x~0);< 6123#rec2ENTRY ~j := #in~j; 6147#L18 assume !(~j <= 0); 6144#L20 call #t~ret3 := rec1(~j - 1);< 6146#rec1ENTRY ~i := #in~i; 6145#L12 assume !(~i <= 0); 6112#L14 call #t~ret0 := rec1(~i - 2);< 6125#rec1ENTRY ~i := #in~i; 6096#L12 assume !(~i <= 0); 6095#L14 [2018-11-10 05:05:39,222 INFO L795 eck$LassoCheckResult]: Loop: 6095#L14 call #t~ret0 := rec1(~i - 2);< 6094#rec1ENTRY ~i := #in~i; 6096#L12 assume !(~i <= 0); 6095#L14 [2018-11-10 05:05:39,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1203085824, now seen corresponding path program 3 times [2018-11-10 05:05:39,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:39,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:39,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:39,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:39,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 55742, now seen corresponding path program 4 times [2018-11-10 05:05:39,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:39,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:39,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:39,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:39,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:39,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash 372328287, now seen corresponding path program 4 times [2018-11-10 05:05:39,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:39,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:39,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:39,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:39,284 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:39,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:39,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:39,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:39,284 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:05:39,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:39,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:39,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:39,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-10 05:05:39,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:39,284 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:39,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:39,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:39,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:39,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:39,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:39,316 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:39,316 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:39,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:39,319 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/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 [2018-11-10 05:05:39,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:05:39,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:41,197 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:05:41,198 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:41,198 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:41,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:41,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:41,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:05:41,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:41,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:41,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-10 05:05:41,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:41,199 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:41,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,224 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:41,224 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:05:41,225 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 [2018-11-10 05:05:41,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:41,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:41,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:41,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:41,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:41,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:41,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:41,229 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:05:41,230 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:05:41,231 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:05:41,231 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:05:41,231 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:05:41,231 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:05:41,231 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_~i) = 1*rec1_~i Supporting invariants [] [2018-11-10 05:05:41,231 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:05:41,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:41,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:41,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:05:41,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:05:41,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 107 transitions. cyclomatic complexity: 23 Second operand 4 states. [2018-11-10 05:05:41,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 107 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 101 states and 125 transitions. Complement of second has 11 states. [2018-11-10 05:05:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:05:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:05:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-10 05:05:41,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 05:05:41,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:41,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-10 05:05:41,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:41,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-10 05:05:41,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:41,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 125 transitions. [2018-11-10 05:05:41,299 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:05:41,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 95 states and 118 transitions. [2018-11-10 05:05:41,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-10 05:05:41,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-10 05:05:41,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 118 transitions. [2018-11-10 05:05:41,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:41,302 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 118 transitions. [2018-11-10 05:05:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 118 transitions. [2018-11-10 05:05:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-10 05:05:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 05:05:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-11-10 05:05:41,305 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-11-10 05:05:41,305 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-11-10 05:05:41,305 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 05:05:41,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. [2018-11-10 05:05:41,306 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:05:41,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:05:41,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:05:41,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:05:41,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 05:05:41,307 INFO L793 eck$LassoCheckResult]: Stem: 6376#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 6374#L25 call main_#t~ret6 := rec2(main_~x~0);< 6382#rec2ENTRY ~j := #in~j; 6380#L18 assume !(~j <= 0); 6381#L20 call #t~ret3 := rec1(~j - 1);< 6403#rec1ENTRY ~i := #in~i; 6404#L12 assume !(~i <= 0); 6368#L14 call #t~ret0 := rec1(~i - 2);< 6399#rec1ENTRY ~i := #in~i; 6438#L12 assume !(~i <= 0); 6353#L14 call #t~ret0 := rec1(~i - 2);< 6352#rec1ENTRY ~i := #in~i; 6354#L12 assume ~i <= 0;#res := 0; 6441#rec1FINAL assume true; 6409#rec1EXIT >#28#return; 6361#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6367#rec1ENTRY ~i := #in~i; 6434#L12 assume ~i <= 0;#res := 0; 6431#rec1FINAL assume true; 6375#rec1EXIT >#30#return; 6371#L14-2 call #t~ret2 := rec1(#t~ret1);< 6372#rec1ENTRY ~i := #in~i; 6405#L12 assume ~i <= 0;#res := 0; 6402#rec1FINAL assume true; 6400#rec1EXIT >#32#return; 6369#L14-3 #res := #t~ret2 + 1;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 6370#rec1FINAL assume true; 6398#rec1EXIT >#28#return; 6363#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6397#rec1ENTRY [2018-11-10 05:05:41,307 INFO L795 eck$LassoCheckResult]: Loop: 6397#rec1ENTRY ~i := #in~i; 6406#L12 assume !(~i <= 0); 6362#L14 call #t~ret0 := rec1(~i - 2);< 6377#rec1ENTRY ~i := #in~i; 6357#L12 assume !(~i <= 0); 6356#L14 call #t~ret0 := rec1(~i - 2);< 6355#rec1ENTRY ~i := #in~i; 6358#L12 assume ~i <= 0;#res := 0; 6359#rec1FINAL assume true; 6360#rec1EXIT >#28#return; 6361#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6367#rec1ENTRY ~i := #in~i; 6434#L12 assume ~i <= 0;#res := 0; 6431#rec1FINAL assume true; 6375#rec1EXIT >#30#return; 6371#L14-2 call #t~ret2 := rec1(#t~ret1);< 6372#rec1ENTRY ~i := #in~i; 6405#L12 assume ~i <= 0;#res := 0; 6402#rec1FINAL assume true; 6400#rec1EXIT >#32#return; 6369#L14-3 #res := #t~ret2 + 1;havoc #t~ret2;havoc #t~ret0;havoc #t~ret1; 6370#rec1FINAL assume true; 6398#rec1EXIT >#28#return; 6364#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6397#rec1ENTRY [2018-11-10 05:05:41,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:41,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1060897207, now seen corresponding path program 1 times [2018-11-10 05:05:41,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:41,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:41,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:41,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:05:41,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:41,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash 245881341, now seen corresponding path program 1 times [2018-11-10 05:05:41,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:41,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:41,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:41,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:05:41,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2071488077, now seen corresponding path program 2 times [2018-11-10 05:05:41,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:05:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:05:41,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:41,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:05:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:05:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 05:05:41,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:05:41,384 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:05:41,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:05:41,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:05:41,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:05:41,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 05:05:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:05:41,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 05:05:41,566 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:41,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:41,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:41,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:41,566 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:05:41,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:41,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:41,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-11-10 05:05:41,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:41,566 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:41,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,601 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:41,602 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:41,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:41,608 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:41,609 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:41,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:41,640 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:41,640 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:41,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:41,673 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:05:41,673 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:05:41,701 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5feeb41b-0ce6-4dfb-83f4-03a4ae7691d1/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:05:41,723 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:05:41,740 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:05:41,741 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:05:41,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:05:41,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:05:41,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:05:41,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:05:41,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:05:41,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:05:41,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:05:41,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-11-10 05:05:41,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:05:41,742 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:05:41,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:05:41,772 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:05:41,772 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:05:41,772 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 [2018-11-10 05:05:41,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:41,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:41,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:41,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:41,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:41,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:41,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:41,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:41,774 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 [2018-11-10 05:05:41,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:41,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:41,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:41,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:41,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:41,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:41,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:41,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:05:41,776 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 [2018-11-10 05:05:41,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:05:41,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:05:41,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:05:41,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:05:41,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:05:41,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:05:41,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:05:41,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:05:41,780 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:05:41,780 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:05:41,780 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:05:41,780 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:05:41,781 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:05:41,781 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2018-11-10 05:05:41,781 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:05:41,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:41,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:41,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:05:41,937 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 05:05:41,937 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand 11 states. [2018-11-10 05:05:41,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 101 states and 123 transitions. Complement of second has 7 states. [2018-11-10 05:05:41,972 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 [2018-11-10 05:05:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:05:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-10 05:05:41,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 30 letters. Loop has 24 letters. [2018-11-10 05:05:41,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:41,973 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:05:41,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:42,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:42,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:05:42,084 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 05:05:42,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand 11 states. [2018-11-10 05:05:42,118 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 101 states and 123 transitions. Complement of second has 7 states. [2018-11-10 05:05:42,118 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 [2018-11-10 05:05:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:05:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-10 05:05:42,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 30 letters. Loop has 24 letters. [2018-11-10 05:05:42,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:42,119 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:05:42,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:42,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:42,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:05:42,257 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 9 loop predicates [2018-11-10 05:05:42,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand 11 states. [2018-11-10 05:05:42,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 258 states and 304 transitions. Complement of second has 31 states. [2018-11-10 05:05:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 05:05:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:05:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2018-11-10 05:05:42,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 30 letters. Loop has 24 letters. [2018-11-10 05:05:42,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:42,419 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:05:42,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:05:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:42,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:05:42,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:05:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:05:42,535 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 05:05:42,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand 11 states. [2018-11-10 05:05:42,817 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 410 states and 516 transitions. Complement of second has 80 states. [2018-11-10 05:05:42,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 05:05:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:05:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2018-11-10 05:05:42,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 50 transitions. Stem has 30 letters. Loop has 24 letters. [2018-11-10 05:05:42,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:42,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 50 transitions. Stem has 54 letters. Loop has 24 letters. [2018-11-10 05:05:42,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:42,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 50 transitions. Stem has 30 letters. Loop has 48 letters. [2018-11-10 05:05:42,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:05:42,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 410 states and 516 transitions. [2018-11-10 05:05:42,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2018-11-10 05:05:42,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 410 states to 254 states and 346 transitions. [2018-11-10 05:05:42,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-10 05:05:42,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2018-11-10 05:05:42,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 346 transitions. [2018-11-10 05:05:42,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:05:42,826 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 346 transitions. [2018-11-10 05:05:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 346 transitions. [2018-11-10 05:05:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2018-11-10 05:05:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 05:05:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 271 transitions. [2018-11-10 05:05:42,833 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 271 transitions. [2018-11-10 05:05:42,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:05:42,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:05:42,834 INFO L87 Difference]: Start difference. First operand 217 states and 271 transitions. Second operand 8 states. [2018-11-10 05:05:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:05:42,883 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-10 05:05:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:05:42,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2018-11-10 05:05:42,884 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:05:42,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-10 05:05:42,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:05:42,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:05:42,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:05:42,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:05:42,884 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:05:42,884 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:05:42,884 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:05:42,884 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 05:05:42,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:05:42,884 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:05:42,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:05:42,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:05:42 BoogieIcfgContainer [2018-11-10 05:05:42,888 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:05:42,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:05:42,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:05:42,889 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:05:42,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:05:33" (3/4) ... [2018-11-10 05:05:42,891 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:05:42,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:05:42,892 INFO L168 Benchmark]: Toolchain (without parser) took 9324.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -112.9 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:05:42,893 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:05:42,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.67 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:05:42,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.28 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:05:42,893 INFO L168 Benchmark]: Boogie Preprocessor took 10.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 943.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:05:42,894 INFO L168 Benchmark]: RCFGBuilder took 193.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:05:42,894 INFO L168 Benchmark]: BuchiAutomizer took 8963.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 115.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:05:42,894 INFO L168 Benchmark]: Witness Printer took 2.77 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. [2018-11-10 05:05:42,897 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 131.67 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 20.28 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 943.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8963.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 115.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 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 12 terminating modules (5 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 11 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1931bd27 and consists of 11 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 15 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 5.4s. Construction of modules took 0.8s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 249 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 315 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 38/58 HoareTripleCheckerStatistics: 305 SDtfs, 344 SDslu, 582 SDs, 0 SdLazy, 963 SolverSat, 316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT3 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf98 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...