./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99889f5d790024002a8c8a36b020b427b7a21ac2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 17:36:25,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:36:25,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:36:25,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:36:25,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:36:25,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:36:25,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:36:25,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:36:25,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:36:25,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:36:25,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:36:25,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:36:25,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:36:25,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:36:25,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:36:25,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:36:25,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:36:25,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:36:25,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:36:25,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:36:25,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:36:25,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:36:25,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:36:25,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:36:25,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:36:25,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:36:25,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:36:25,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:36:25,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:36:25,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:36:25,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:36:25,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:36:25,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:36:25,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:36:25,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:36:25,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:36:25,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:36:25,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:36:25,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:36:25,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:36:25,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:36:25,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:36:25,874 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:36:25,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:36:25,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:36:25,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:36:25,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:36:25,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:36:25,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:36:25,877 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:36:25,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:36:25,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:36:25,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:36:25,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:36:25,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:36:25,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:36:25,878 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:36:25,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:36:25,879 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:36:25,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:36:25,879 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:36:25,879 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:36:25,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:36:25,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:36:25,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:36:25,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:36:25,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:36:25,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:36:25,881 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:36:25,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:36:25,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:36:25,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99889f5d790024002a8c8a36b020b427b7a21ac2 [2020-12-01 17:36:26,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:36:26,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:36:26,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:36:26,197 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:36:26,198 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:36:26,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2020-12-01 17:36:26,317 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/data/70c11d823/4cfcde4c37f748f9ada4ca72fb1338bb/FLAGb65d5b8e4 [2020-12-01 17:36:26,855 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:36:26,856 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2020-12-01 17:36:26,863 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/data/70c11d823/4cfcde4c37f748f9ada4ca72fb1338bb/FLAGb65d5b8e4 [2020-12-01 17:36:27,223 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/data/70c11d823/4cfcde4c37f748f9ada4ca72fb1338bb [2020-12-01 17:36:27,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:36:27,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:36:27,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:36:27,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:36:27,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:36:27,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63286ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27, skipping insertion in model container [2020-12-01 17:36:27,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:36:27,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:36:27,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:36:27,434 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:36:27,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:36:27,468 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:36:27,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27 WrapperNode [2020-12-01 17:36:27,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:36:27,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:36:27,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:36:27,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:36:27,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:36:27,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:36:27,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:36:27,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:36:27,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:36:27,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:36:27,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:36:27,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:36:27,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:36:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:36:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:36:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-12-01 17:36:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-12-01 17:36:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:36:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-12-01 17:36:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-12-01 17:36:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:36:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:36:27,891 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:36:27,891 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-01 17:36:27,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:36:27 BoogieIcfgContainer [2020-12-01 17:36:27,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:36:27,895 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 17:36:27,895 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 17:36:27,906 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 17:36:27,907 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:36:27" (1/1) ... [2020-12-01 17:36:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:36:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2020-12-01 17:36:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-01 17:36:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 17:36:27,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:36:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2020-12-01 17:36:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-12-01 17:36:28,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-01 17:36:28,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:36:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2020-12-01 17:36:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2020-12-01 17:36:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:36:28,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-01 17:36:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2020-12-01 17:36:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2020-12-01 17:36:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 17:36:28,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-01 17:36:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2020-12-01 17:36:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-12-01 17:36:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 17:36:29,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 17:36:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2020-12-01 17:36:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2020-12-01 17:36:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 17:36:30,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-01 17:36:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 45 states and 66 transitions. [2020-12-01 17:36:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2020-12-01 17:36:31,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 17:36:31,838 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 17:36:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 57 states and 95 transitions. [2020-12-01 17:36:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2020-12-01 17:36:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-01 17:36:33,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 17:36:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 57 states and 94 transitions. [2020-12-01 17:36:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 94 transitions. [2020-12-01 17:36:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-01 17:36:33,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 17:36:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 62 states and 104 transitions. [2020-12-01 17:36:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2020-12-01 17:36:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 17:36:36,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-12-01 17:36:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 74 states and 132 transitions. [2020-12-01 17:36:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2020-12-01 17:36:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-01 17:36:38,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-12-01 17:36:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 76 states and 134 transitions. [2020-12-01 17:36:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2020-12-01 17:36:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-12-01 17:36:39,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 59 proven. 341 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2020-12-01 17:36:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 86 states and 162 transitions. [2020-12-01 17:36:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 162 transitions. [2020-12-01 17:36:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-01 17:36:41,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2020-12-01 17:36:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 88 states and 164 transitions. [2020-12-01 17:36:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 164 transitions. [2020-12-01 17:36:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-01 17:36:41,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 36 proven. 151 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2020-12-01 17:36:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 90 states and 166 transitions. [2020-12-01 17:36:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 166 transitions. [2020-12-01 17:36:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-01 17:36:42,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 140 proven. 168 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2020-12-01 17:36:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 90 states and 164 transitions. [2020-12-01 17:36:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2020-12-01 17:36:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-01 17:36:43,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 45 proven. 260 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2020-12-01 17:36:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 100 states and 193 transitions. [2020-12-01 17:36:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 193 transitions. [2020-12-01 17:36:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2020-12-01 17:36:45,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 88 proven. 588 refuted. 0 times theorem prover too weak. 2319 trivial. 0 not checked. [2020-12-01 17:36:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 102 states and 195 transitions. [2020-12-01 17:36:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 195 transitions. [2020-12-01 17:36:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-01 17:36:46,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 66 proven. 401 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2020-12-01 17:36:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 104 states and 197 transitions. [2020-12-01 17:36:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2020-12-01 17:36:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2020-12-01 17:36:46,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7277 backedges. 208 proven. 1069 refuted. 0 times theorem prover too weak. 6000 trivial. 0 not checked. [2020-12-01 17:36:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 114 states and 229 transitions. [2020-12-01 17:36:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 229 transitions. [2020-12-01 17:36:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2020-12-01 17:36:49,722 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 629 proven. 754 refuted. 0 times theorem prover too weak. 4361 trivial. 0 not checked. [2020-12-01 17:36:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 114 states and 228 transitions. [2020-12-01 17:36:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 228 transitions. [2020-12-01 17:36:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2020-12-01 17:36:51,292 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18304 backedges. 262 proven. 1830 refuted. 0 times theorem prover too weak. 16212 trivial. 0 not checked. [2020-12-01 17:36:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 116 states and 230 transitions. [2020-12-01 17:36:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 230 transitions. [2020-12-01 17:36:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2020-12-01 17:36:52,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17073 backedges. 253 proven. 1747 refuted. 0 times theorem prover too weak. 15073 trivial. 0 not checked. [2020-12-01 17:36:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 118 states and 232 transitions. [2020-12-01 17:36:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 232 transitions. [2020-12-01 17:36:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2020-12-01 17:36:53,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12466 backedges. 246 proven. 1693 refuted. 0 times theorem prover too weak. 10527 trivial. 0 not checked. [2020-12-01 17:36:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 130 states and 268 transitions. [2020-12-01 17:36:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 268 transitions. [2020-12-01 17:36:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2020-12-01 17:36:57,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:36:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:36:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 920 proven. 1169 refuted. 0 times theorem prover too weak. 6488 trivial. 0 not checked. [2020-12-01 17:36:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:36:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 132 states and 268 transitions. [2020-12-01 17:36:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 268 transitions. [2020-12-01 17:36:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2020-12-01 17:36:59,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 242 proven. 1861 refuted. 0 times theorem prover too weak. 12490 trivial. 0 not checked. [2020-12-01 17:37:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 134 states and 270 transitions. [2020-12-01 17:37:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 270 transitions. [2020-12-01 17:37:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2317 [2020-12-01 17:37:01,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 162157 backedges. 928 proven. 7358 refuted. 0 times theorem prover too weak. 153871 trivial. 0 not checked. [2020-12-01 17:37:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 144 states and 306 transitions. [2020-12-01 17:37:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 306 transitions. [2020-12-01 17:37:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1881 [2020-12-01 17:37:08,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 106711 backedges. 805 proven. 5873 refuted. 0 times theorem prover too weak. 100033 trivial. 0 not checked. [2020-12-01 17:37:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 146 states and 308 transitions. [2020-12-01 17:37:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 308 transitions. [2020-12-01 17:37:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2223 [2020-12-01 17:37:12,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 149142 backedges. 954 proven. 6991 refuted. 0 times theorem prover too weak. 141197 trivial. 0 not checked. [2020-12-01 17:37:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 148 states and 310 transitions. [2020-12-01 17:37:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 310 transitions. [2020-12-01 17:37:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1704 [2020-12-01 17:37:16,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 87295 backedges. 1843 proven. 4115 refuted. 0 times theorem prover too weak. 81337 trivial. 0 not checked. [2020-12-01 17:37:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 148 states and 310 transitions. [2020-12-01 17:37:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 310 transitions. [2020-12-01 17:37:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1690 [2020-12-01 17:37:18,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 85919 backedges. 1355 proven. 4657 refuted. 0 times theorem prover too weak. 79907 trivial. 0 not checked. [2020-12-01 17:37:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 148 states and 310 transitions. [2020-12-01 17:37:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 310 transitions. [2020-12-01 17:37:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2013 [2020-12-01 17:37:21,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 122355 backedges. 1104 proven. 6376 refuted. 0 times theorem prover too weak. 114875 trivial. 0 not checked. [2020-12-01 17:37:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 151 states and 262 transitions. [2020-12-01 17:37:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 262 transitions. [2020-12-01 17:37:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2175 [2020-12-01 17:37:30,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 142616 backedges. 1262 proven. 5072 refuted. 0 times theorem prover too weak. 136282 trivial. 0 not checked. [2020-12-01 17:37:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 153 states and 257 transitions. [2020-12-01 17:37:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 257 transitions. [2020-12-01 17:37:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2020-12-01 17:37:35,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28312 backedges. 2301 proven. 1664 refuted. 0 times theorem prover too weak. 24347 trivial. 0 not checked. [2020-12-01 17:37:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 153 states and 256 transitions. [2020-12-01 17:37:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 256 transitions. [2020-12-01 17:37:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1248 [2020-12-01 17:37:37,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 46537 backedges. 902 proven. 2496 refuted. 0 times theorem prover too weak. 43139 trivial. 0 not checked. [2020-12-01 17:37:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 153 states and 255 transitions. [2020-12-01 17:37:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 255 transitions. [2020-12-01 17:37:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1713 [2020-12-01 17:37:39,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 88077 backedges. 1079 proven. 3629 refuted. 0 times theorem prover too weak. 83369 trivial. 0 not checked. [2020-12-01 17:37:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 153 states and 254 transitions. [2020-12-01 17:37:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 254 transitions. [2020-12-01 17:37:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1318 [2020-12-01 17:37:42,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 51907 backedges. 1496 proven. 3302 refuted. 0 times theorem prover too weak. 47109 trivial. 0 not checked. [2020-12-01 17:37:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 155 states and 252 transitions. [2020-12-01 17:37:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 252 transitions. [2020-12-01 17:37:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1961 [2020-12-01 17:37:45,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 116209 backedges. 899 proven. 6361 refuted. 0 times theorem prover too weak. 108949 trivial. 0 not checked. [2020-12-01 17:37:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 155 states and 244 transitions. [2020-12-01 17:37:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2020-12-01 17:37:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1849 [2020-12-01 17:37:49,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 2089 proven. 3263 refuted. 0 times theorem prover too weak. 97417 trivial. 0 not checked. [2020-12-01 17:37:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 155 states and 239 transitions. [2020-12-01 17:37:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2020-12-01 17:37:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2020-12-01 17:37:52,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 1341 proven. 937 refuted. 0 times theorem prover too weak. 26874 trivial. 0 not checked. [2020-12-01 17:37:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 155 states and 238 transitions. [2020-12-01 17:37:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2020-12-01 17:37:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1495 [2020-12-01 17:37:54,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 2934 proven. 1957 refuted. 0 times theorem prover too weak. 62041 trivial. 0 not checked. [2020-12-01 17:37:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 155 states and 236 transitions. [2020-12-01 17:37:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2020-12-01 17:37:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2020-12-01 17:37:57,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:37:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2126 proven. 649 refuted. 0 times theorem prover too weak. 28861 trivial. 0 not checked. [2020-12-01 17:37:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:37:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 155 states and 235 transitions. [2020-12-01 17:37:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 235 transitions. [2020-12-01 17:37:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2020-12-01 17:37:59,166 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:37:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:37:59,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:37:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:37:59,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:38:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:38:01,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:38:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:38:01,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:38:13,569 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 42 iterations. [2020-12-01 17:38:13,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:38:13 ImpRootNode [2020-12-01 17:38:13,937 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:38:13,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:38:13,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:38:13,938 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:38:13,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:36:27" (3/4) ... [2020-12-01 17:38:13,941 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:38:14,354 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7935a28f-98ad-46ce-a104-2fe3275b6899/bin/ukojak/witness.graphml [2020-12-01 17:38:14,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:38:14,357 INFO L168 Benchmark]: Toolchain (without parser) took 107126.88 ms. Allocated memory was 98.6 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 70.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2020-12-01 17:38:14,357 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 98.6 MB. Free memory was 56.0 MB in the beginning and 55.9 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:38:14,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.41 ms. Allocated memory is still 98.6 MB. Free memory was 70.1 MB in the beginning and 75.7 MB in the end (delta: -5.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:38:14,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.86 ms. Allocated memory is still 98.6 MB. Free memory was 75.7 MB in the beginning and 74.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:38:14,359 INFO L168 Benchmark]: Boogie Preprocessor took 49.88 ms. Allocated memory is still 98.6 MB. Free memory was 74.5 MB in the beginning and 73.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:38:14,360 INFO L168 Benchmark]: RCFGBuilder took 318.79 ms. Allocated memory is still 98.6 MB. Free memory was 73.3 MB in the beginning and 58.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-01 17:38:14,360 INFO L168 Benchmark]: CodeCheck took 106042.37 ms. Allocated memory was 98.6 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 58.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2020-12-01 17:38:14,361 INFO L168 Benchmark]: Witness Printer took 416.64 ms. Allocated memory is still 3.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:38:14,363 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 105.6s, OverallIterations: 42, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 581722108 SDtfs, 2052929916 SDslu, 1220538616 SDs, 0 SdLazy, 995627700 SolverSat, 2091364916 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88375 GetRequests, 86257 SyntacticMatches, 1692 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106827 ImplicationChecksByTransitivity, 45.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 34040 NumberOfCodeBlocks, 34040 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 32791 ConstructedInterpolants, 0 QuantifiedInterpolants, 54483931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 1433895/1511008 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 10; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 55 [L4] __assert_fail("0", "fibo_2calls_10-2.c", 4, "reach_error") * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 98.6 MB. Free memory was 56.0 MB in the beginning and 55.9 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 238.41 ms. Allocated memory is still 98.6 MB. Free memory was 70.1 MB in the beginning and 75.7 MB in the end (delta: -5.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.86 ms. Allocated memory is still 98.6 MB. Free memory was 75.7 MB in the beginning and 74.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.88 ms. Allocated memory is still 98.6 MB. Free memory was 74.5 MB in the beginning and 73.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 318.79 ms. Allocated memory is still 98.6 MB. Free memory was 73.3 MB in the beginning and 58.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * CodeCheck took 106042.37 ms. Allocated memory was 98.6 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 58.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. * Witness Printer took 416.64 ms. Allocated memory is still 3.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...