./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --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 ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:11:07,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:11:07,702 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:11:07,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:11:07,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:11:07,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:11:07,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:11:07,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:11:07,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:11:07,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:11:07,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:11:07,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:11:07,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:11:07,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:11:07,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:11:07,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:11:07,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:11:07,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:11:07,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:11:07,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:11:07,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:11:07,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:11:07,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:11:07,768 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:11:07,768 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:11:07,769 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:11:07,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:11:07,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:11:07,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:11:07,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:11:07,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:11:07,773 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:11:07,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:11:07,774 INFO L153 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_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/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_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2024-11-08 23:11:08,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:11:08,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:11:08,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:11:08,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:11:08,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:11:08,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c Unable to find full path for "g++" [2024-11-08 23:11:10,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:10,678 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:10,680 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2024-11-08 23:11:10,693 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/data/7702ed3dc/1e0a36f80f1b4234874d9488d4b80594/FLAGdc97e318c [2024-11-08 23:11:10,721 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/data/7702ed3dc/1e0a36f80f1b4234874d9488d4b80594 [2024-11-08 23:11:10,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:10,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:10,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:10,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:10,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:10,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:10" (1/1) ... [2024-11-08 23:11:10,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8c4b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:10, skipping insertion in model container [2024-11-08 23:11:10,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:10" (1/1) ... [2024-11-08 23:11:10,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:11,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2024-11-08 23:11:11,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:11,064 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:11,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2024-11-08 23:11:11,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:11,104 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:11,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11 WrapperNode [2024-11-08 23:11:11,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:11,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:11,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:11,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:11,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,144 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-08 23:11:11,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:11,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:11,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:11,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:11,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:11,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:11,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:11,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:11,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:11:11,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:11:11,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:11:11,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:11:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:11:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-08 23:11:11,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-08 23:11:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-08 23:11:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-08 23:11:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:11,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:11,329 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:11,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:11:11,508 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 23:11:11,509 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:11:11,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:11:11,543 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 23:11:11,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:11 BoogieIcfgContainer [2024-11-08 23:11:11,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:11:11,545 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:11:11,545 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:11:11,556 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:11:11,556 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:11" (1/1) ... [2024-11-08 23:11:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2024-11-08 23:11:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-08 23:11:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:11:11,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:11:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2024-11-08 23:11:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-08 23:11:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:11:12,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:11:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2024-11-08 23:11:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-11-08 23:11:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:11:12,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:11:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2024-11-08 23:11:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-11-08 23:11:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:11:13,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 23:11:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2024-11-08 23:11:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2024-11-08 23:11:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:11:14,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:14,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:14,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:11:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2024-11-08 23:11:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-11-08 23:11:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:11:14,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 23:11:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 45 states and 66 transitions. [2024-11-08 23:11:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-11-08 23:11:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:11:16,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:11:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 57 states and 95 transitions. [2024-11-08 23:11:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2024-11-08 23:11:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 23:11:18,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 23:11:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 57 states and 94 transitions. [2024-11-08 23:11:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 94 transitions. [2024-11-08 23:11:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 23:11:18,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 23:11:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 62 states and 104 transitions. [2024-11-08 23:11:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2024-11-08 23:11:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:11:21,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 23:11:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 74 states and 132 transitions. [2024-11-08 23:11:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2024-11-08 23:11:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:11:23,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 98 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-08 23:11:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 76 states and 134 transitions. [2024-11-08 23:11:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-11-08 23:11:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 23:11:23,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 51 proven. 299 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 23:11:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 86 states and 162 transitions. [2024-11-08 23:11:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 162 transitions. [2024-11-08 23:11:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 23:11:26,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 36 proven. 151 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-08 23:11:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 88 states and 164 transitions. [2024-11-08 23:11:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 164 transitions. [2024-11-08 23:11:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 23:11:26,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:26,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 51 proven. 299 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 23:11:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 90 states and 166 transitions. [2024-11-08 23:11:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 166 transitions. [2024-11-08 23:11:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 23:11:27,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 140 proven. 168 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-08 23:11:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 90 states and 164 transitions. [2024-11-08 23:11:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2024-11-08 23:11:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 23:11:29,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 88 proven. 588 refuted. 0 times theorem prover too weak. 2319 trivial. 0 not checked. [2024-11-08 23:11:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 100 states and 193 transitions. [2024-11-08 23:11:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 193 transitions. [2024-11-08 23:11:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 23:11:32,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 82 proven. 493 refuted. 0 times theorem prover too weak. 1670 trivial. 0 not checked. [2024-11-08 23:11:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 102 states and 195 transitions. [2024-11-08 23:11:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 195 transitions. [2024-11-08 23:11:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 23:11:32,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 71 proven. 461 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2024-11-08 23:11:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 104 states and 197 transitions. [2024-11-08 23:11:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2024-11-08 23:11:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2024-11-08 23:11:33,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:33,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 17073 backedges. 253 proven. 1747 refuted. 0 times theorem prover too weak. 15073 trivial. 0 not checked. [2024-11-08 23:11:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 114 states and 229 transitions. [2024-11-08 23:11:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 229 transitions. [2024-11-08 23:11:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-11-08 23:11:37,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 629 proven. 754 refuted. 0 times theorem prover too weak. 4361 trivial. 0 not checked. [2024-11-08 23:11:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 114 states and 228 transitions. [2024-11-08 23:11:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 228 transitions. [2024-11-08 23:11:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-08 23:11:38,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 191 proven. 966 refuted. 0 times theorem prover too weak. 4933 trivial. 0 not checked. [2024-11-08 23:11:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 116 states and 230 transitions. [2024-11-08 23:11:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 230 transitions. [2024-11-08 23:11:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2024-11-08 23:11:39,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 236 proven. 1616 refuted. 0 times theorem prover too weak. 12741 trivial. 0 not checked. [2024-11-08 23:11:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 118 states and 232 transitions. [2024-11-08 23:11:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 232 transitions. [2024-11-08 23:11:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-08 23:11:41,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9021 backedges. 933 proven. 1210 refuted. 0 times theorem prover too weak. 6878 trivial. 0 not checked. [2024-11-08 23:11:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 120 states and 232 transitions. [2024-11-08 23:11:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 232 transitions. [2024-11-08 23:11:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2024-11-08 23:11:44,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12466 backedges. 246 proven. 1693 refuted. 0 times theorem prover too weak. 10527 trivial. 0 not checked. [2024-11-08 23:11:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 132 states and 267 transitions. [2024-11-08 23:11:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 267 transitions. [2024-11-08 23:11:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2024-11-08 23:11:48,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13525 backedges. 269 proven. 1742 refuted. 0 times theorem prover too weak. 11514 trivial. 0 not checked. [2024-11-08 23:11:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 134 states and 269 transitions. [2024-11-08 23:11:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 269 transitions. [2024-11-08 23:11:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1062 [2024-11-08 23:11:49,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 33629 backedges. 842 proven. 2838 refuted. 0 times theorem prover too weak. 29949 trivial. 0 not checked. [2024-11-08 23:11:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 136 states and 271 transitions. [2024-11-08 23:11:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 271 transitions. [2024-11-08 23:11:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1250 [2024-11-08 23:11:51,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 46771 backedges. 653 proven. 3733 refuted. 0 times theorem prover too weak. 42385 trivial. 0 not checked. [2024-11-08 23:11:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:11:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 148 states and 309 transitions. [2024-11-08 23:11:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 309 transitions. [2024-11-08 23:11:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1658 [2024-11-08 23:11:57,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:11:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 82527 backedges. 830 proven. 5054 refuted. 0 times theorem prover too weak. 76643 trivial. 0 not checked. [2024-11-08 23:12:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 150 states and 311 transitions. [2024-11-08 23:12:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 311 transitions. [2024-11-08 23:12:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2149 [2024-11-08 23:12:00,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 139503 backedges. 1347 proven. 6655 refuted. 0 times theorem prover too weak. 131501 trivial. 0 not checked. [2024-11-08 23:12:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 153 states and 255 transitions. [2024-11-08 23:12:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 255 transitions. [2024-11-08 23:12:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1821 [2024-11-08 23:12:10,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 99685 backedges. 1858 proven. 2412 refuted. 0 times theorem prover too weak. 95415 trivial. 0 not checked. [2024-11-08 23:12:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 153 states and 254 transitions. [2024-11-08 23:12:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 254 transitions. [2024-11-08 23:12:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1549 [2024-11-08 23:12:13,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 71957 backedges. 1378 proven. 4308 refuted. 0 times theorem prover too weak. 66271 trivial. 0 not checked. [2024-11-08 23:12:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 153 states and 247 transitions. [2024-11-08 23:12:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 247 transitions. [2024-11-08 23:12:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2024-11-08 23:12:17,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 31572 backedges. 2446 proven. 1755 refuted. 0 times theorem prover too weak. 27371 trivial. 0 not checked. [2024-11-08 23:12:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 153 states and 246 transitions. [2024-11-08 23:12:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2024-11-08 23:12:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2067 [2024-11-08 23:12:19,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:19,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 128622 backedges. 1520 proven. 5323 refuted. 0 times theorem prover too weak. 121779 trivial. 0 not checked. [2024-11-08 23:12:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 155 states and 244 transitions. [2024-11-08 23:12:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2024-11-08 23:12:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2024-11-08 23:12:25,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 43597 backedges. 2596 proven. 678 refuted. 0 times theorem prover too weak. 40323 trivial. 0 not checked. [2024-11-08 23:12:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 155 states and 243 transitions. [2024-11-08 23:12:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 243 transitions. [2024-11-08 23:12:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1737 [2024-11-08 23:12:27,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 90737 backedges. 1967 proven. 3057 refuted. 0 times theorem prover too weak. 85713 trivial. 0 not checked. [2024-11-08 23:12:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 155 states and 238 transitions. [2024-11-08 23:12:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2024-11-08 23:12:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1411 [2024-11-08 23:12:31,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 59708 backedges. 2773 proven. 1830 refuted. 0 times theorem prover too weak. 55105 trivial. 0 not checked. [2024-11-08 23:12:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 155 states and 236 transitions. [2024-11-08 23:12:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2024-11-08 23:12:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1153 [2024-11-08 23:12:34,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 39697 backedges. 788 proven. 2345 refuted. 0 times theorem prover too weak. 36564 trivial. 0 not checked. [2024-11-08 23:12:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:12:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 155 states and 235 transitions. [2024-11-08 23:12:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 235 transitions. [2024-11-08 23:12:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2024-11-08 23:12:36,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:12:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:36,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:12:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:37,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:12:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:37,924 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 38 iterations. [2024-11-08 23:12:38,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:12:38 ImpRootNode [2024-11-08 23:12:38,119 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:12:38,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:12:38,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:12:38,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:12:38,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:11" (3/4) ... [2024-11-08 23:12:38,125 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:12:38,352 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:12:38,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:12:38,356 INFO L158 Benchmark]: Toolchain (without parser) took 87629.46ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 112.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 290.1MB. Max. memory is 16.1GB. [2024-11-08 23:12:38,356 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 142.6MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:12:38,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.24ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:12:38,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.41ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:12:38,357 INFO L158 Benchmark]: Boogie Preprocessor took 22.65ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 999.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:12:38,357 INFO L158 Benchmark]: RCFGBuilder took 375.17ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 86.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:12:38,358 INFO L158 Benchmark]: CodeCheck took 86574.21ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 86.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 241.8MB. Max. memory is 16.1GB. [2024-11-08 23:12:38,358 INFO L158 Benchmark]: Witness Printer took 235.67ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 23:12:38,361 INFO L338 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. OverallTime: 86.3s, OverallIterations: 38, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8286 SdHoareTripleChecker+Valid, 70.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5602 mSDsluCounter, 9634 SdHoareTripleChecker+Invalid, 60.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6520 mSDsCounter, 11681 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42616 IncrementalHoareTripleChecker+Invalid, 54297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11681 mSolverCounterUnsat, 3114 mSDtfsCounter, 42616 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70637 GetRequests, 68742 SyntacticMatches, 1473 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101252 ImplicationChecksByTransitivity, 39.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 42.4s InterpolantComputationTime, 25595 NumberOfCodeBlocks, 25595 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 24350 ConstructedInterpolants, 0 QuantifiedInterpolants, 27890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 2 PerfectInterpolantSequences, 905552/957936 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, 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] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, 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] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, 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] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, 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] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [x=10] [L41] reach_error() VAL [x=10] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 142.6MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.24ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.41ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.65ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 999.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.17ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 86.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 86574.21ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 86.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 241.8MB. Max. memory is 16.1GB. * Witness Printer took 235.67ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:12:38,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e662480-7873-4c33-9c74-9fb6a52550ef/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE