./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 17:09:50,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 17:09:50,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 17:09:50,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 17:09:50,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 17:09:50,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 17:09:50,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 17:09:50,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 17:09:50,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 17:09:50,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 17:09:50,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 17:09:50,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 17:09:50,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 17:09:50,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 17:09:50,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 17:09:50,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 17:09:50,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 17:09:50,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 17:09:50,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 17:09:50,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 17:09:50,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 17:09:50,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 17:09:50,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 17:09:50,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 17:09:50,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 17:09:50,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 17:09:50,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 17:09:50,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 17:09:50,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 17:09:50,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 17:09:50,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 17:09:50,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 17:09:50,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 17:09:50,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 17:09:50,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 17:09:50,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 17:09:50,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 17:09:50,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 17:09:50,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 17:09:50,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 17:09:50,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 17:09:50,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-11-20 17:09:50,832 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 17:09:50,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 17:09:50,834 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 17:09:50,834 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-11-20 17:09:50,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 17:09:50,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 17:09:50,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 17:09:50,835 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 17:09:50,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 17:09:50,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 17:09:50,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 17:09:50,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 17:09:50,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 17:09:50,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 17:09:50,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 17:09:50,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 17:09:50,838 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 17:09:50,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 17:09:50,838 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-11-20 17:09:50,838 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-11-20 17:09:50,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 17:09:50,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-20 17:09:50,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 17:09:50,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 17:09:50,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 17:09:50,840 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-11-20 17:09:50,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 17:09:50,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 17:09:50,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/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_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2022-11-20 17:09:51,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 17:09:51,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 17:09:51,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 17:09:51,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 17:09:51,181 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 17:09:51,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/../../sv-benchmarks/c/recursive/Fibonacci05.c [2022-11-20 17:09:54,181 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 17:09:54,415 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 17:09:54,420 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/sv-benchmarks/c/recursive/Fibonacci05.c [2022-11-20 17:09:54,431 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/data/1c96c6f90/a0940a69a8394e238401fa19765a4828/FLAGab8707448 [2022-11-20 17:09:54,444 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/data/1c96c6f90/a0940a69a8394e238401fa19765a4828 [2022-11-20 17:09:54,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 17:09:54,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 17:09:54,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 17:09:54,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 17:09:54,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 17:09:54,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a97b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54, skipping insertion in model container [2022-11-20 17:09:54,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 17:09:54,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 17:09:54,624 WARN L237 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_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-11-20 17:09:54,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 17:09:54,638 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 17:09:54,649 WARN L237 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_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-11-20 17:09:54,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 17:09:54,663 INFO L208 MainTranslator]: Completed translation [2022-11-20 17:09:54,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54 WrapperNode [2022-11-20 17:09:54,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 17:09:54,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 17:09:54,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 17:09:54,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 17:09:54,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,693 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-11-20 17:09:54,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 17:09:54,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 17:09:54,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 17:09:54,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 17:09:54,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,710 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 17:09:54,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 17:09:54,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 17:09:54,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 17:09:54,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:09:54" (1/1) ... [2022-11-20 17:09:54,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-20 17:09:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/z3 [2022-11-20 17:09:54,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-11-20 17:09:54,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-11-20 17:09:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-11-20 17:09:54,780 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-11-20 17:09:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 17:09:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 17:09:54,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 17:09:54,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 17:09:54,856 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 17:09:54,859 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 17:09:55,050 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 17:09:55,064 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 17:09:55,064 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 17:09:55,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:55 BoogieIcfgContainer [2022-11-20 17:09:55,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 17:09:55,067 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-11-20 17:09:55,067 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-11-20 17:09:55,077 INFO L275 PluginConnector]: CodeCheck initialized [2022-11-20 17:09:55,078 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:55" (1/1) ... [2022-11-20 17:09:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 17:09:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2022-11-20 17:09:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-20 17:09:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 17:09:55,148 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:09:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2022-11-20 17:09:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-11-20 17:09:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 17:09:55,575 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:55,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:09:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2022-11-20 17:09:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-11-20 17:09:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 17:09:55,882 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:55,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 17:09:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2022-11-20 17:09:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-20 17:09:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 17:09:56,229 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 17:09:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2022-11-20 17:09:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2022-11-20 17:09:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 17:09:56,738 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 17:09:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 35 states and 56 transitions. [2022-11-20 17:09:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2022-11-20 17:09:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 17:09:57,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:57,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 17:09:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 42 states and 74 transitions. [2022-11-20 17:09:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2022-11-20 17:09:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 17:09:58,248 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 47 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 17:09:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 42 states and 73 transitions. [2022-11-20 17:09:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2022-11-20 17:09:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-20 17:09:58,862 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:58,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-20 17:09:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:09:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 49 states and 93 transitions. [2022-11-20 17:09:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 93 transitions. [2022-11-20 17:09:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 17:09:59,594 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:09:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:09:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:09:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 131 proven. 122 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-20 17:10:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 49 states and 92 transitions. [2022-11-20 17:10:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 92 transitions. [2022-11-20 17:10:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 17:10:00,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 54 proven. 273 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-11-20 17:10:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 56 states and 114 transitions. [2022-11-20 17:10:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2022-11-20 17:10:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-20 17:10:01,033 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 117 proven. 639 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2022-11-20 17:10:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 63 states and 139 transitions. [2022-11-20 17:10:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 139 transitions. [2022-11-20 17:10:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-20 17:10:02,101 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:02,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 401 proven. 383 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2022-11-20 17:10:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 65 states and 140 transitions. [2022-11-20 17:10:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 140 transitions. [2022-11-20 17:10:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-11-20 17:10:03,287 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:03,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9549 backedges. 297 proven. 1714 refuted. 0 times theorem prover too weak. 7538 trivial. 0 not checked. [2022-11-20 17:10:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 72 states and 167 transitions. [2022-11-20 17:10:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 167 transitions. [2022-11-20 17:10:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-11-20 17:10:04,821 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6549 backedges. 1052 proven. 747 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2022-11-20 17:10:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 74 states and 168 transitions. [2022-11-20 17:10:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 168 transitions. [2022-11-20 17:10:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-11-20 17:10:06,331 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:06,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14031 backedges. 922 proven. 870 refuted. 0 times theorem prover too weak. 12239 trivial. 0 not checked. [2022-11-20 17:10:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 74 states and 167 transitions. [2022-11-20 17:10:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2022-11-20 17:10:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2022-11-20 17:10:07,248 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:07,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 32112 backedges. 909 proven. 3762 refuted. 0 times theorem prover too weak. 27441 trivial. 0 not checked. [2022-11-20 17:10:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 74 states and 167 transitions. [2022-11-20 17:10:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2022-11-20 17:10:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2022-11-20 17:10:08,565 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 27189 backedges. 734 proven. 3541 refuted. 0 times theorem prover too weak. 22914 trivial. 0 not checked. [2022-11-20 17:10:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 74 states and 167 transitions. [2022-11-20 17:10:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2022-11-20 17:10:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-11-20 17:10:09,713 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 744 proven. 3063 refuted. 0 times theorem prover too weak. 18126 trivial. 0 not checked. [2022-11-20 17:10:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 74 states and 167 transitions. [2022-11-20 17:10:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2022-11-20 17:10:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2022-11-20 17:10:10,738 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17241 backedges. 1561 proven. 435 refuted. 0 times theorem prover too weak. 15245 trivial. 0 not checked. [2022-11-20 17:10:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 74 states and 166 transitions. [2022-11-20 17:10:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 166 transitions. [2022-11-20 17:10:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2022-11-20 17:10:11,590 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 17:10:11,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 17:10:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 17:10:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 17:10:12,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 17:10:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 17:10:12,320 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 20 iterations. [2022-11-20 17:10:12,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 05:10:12 ImpRootNode [2022-11-20 17:10:12,511 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-11-20 17:10:12,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 17:10:12,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 17:10:12,512 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 17:10:12,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:09:55" (3/4) ... [2022-11-20 17:10:12,517 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 17:10:12,705 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/witness.graphml [2022-11-20 17:10:12,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 17:10:12,706 INFO L158 Benchmark]: Toolchain (without parser) took 18258.13ms. Allocated memory was 130.0MB in the beginning and 467.7MB in the end (delta: 337.6MB). Free memory was 98.8MB in the beginning and 232.2MB in the end (delta: -133.3MB). Peak memory consumption was 207.1MB. Max. memory is 16.1GB. [2022-11-20 17:10:12,706 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory was 101.3MB in the beginning and 101.2MB in the end (delta: 90.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 17:10:12,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.91ms. Allocated memory is still 130.0MB. Free memory was 98.5MB in the beginning and 88.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 17:10:12,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 130.0MB. Free memory was 88.8MB in the beginning and 87.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 17:10:12,707 INFO L158 Benchmark]: Boogie Preprocessor took 18.17ms. Allocated memory is still 130.0MB. Free memory was 87.5MB in the beginning and 86.6MB in the end (delta: 837.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 17:10:12,708 INFO L158 Benchmark]: RCFGBuilder took 353.15ms. Allocated memory is still 130.0MB. Free memory was 86.2MB in the beginning and 76.3MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 17:10:12,708 INFO L158 Benchmark]: CodeCheck took 17443.50ms. Allocated memory was 130.0MB in the beginning and 467.7MB in the end (delta: 337.6MB). Free memory was 76.3MB in the beginning and 243.7MB in the end (delta: -167.4MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2022-11-20 17:10:12,708 INFO L158 Benchmark]: Witness Printer took 193.65ms. Allocated memory is still 467.7MB. Free memory was 243.7MB in the beginning and 232.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 17:10:12,710 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 20, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2381 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1047 mSDsluCounter, 2434 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1817 mSDsCounter, 1903 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5726 IncrementalHoareTripleChecker+Invalid, 7629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1903 mSolverCounterUnsat, 617 mSDtfsCounter, 5726 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15160 GetRequests, 14888 SyntacticMatches, 112 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14996 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 5108 NumberOfCodeBlocks, 5108 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4630 ConstructedInterpolants, 0 QuantifiedInterpolants, 6143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 2 PerfectInterpolantSequences, 118740/134485 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: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory was 101.3MB in the beginning and 101.2MB in the end (delta: 90.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.91ms. Allocated memory is still 130.0MB. Free memory was 98.5MB in the beginning and 88.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 130.0MB. Free memory was 88.8MB in the beginning and 87.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.17ms. Allocated memory is still 130.0MB. Free memory was 87.5MB in the beginning and 86.6MB in the end (delta: 837.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.15ms. Allocated memory is still 130.0MB. Free memory was 86.2MB in the beginning and 76.3MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 17443.50ms. Allocated memory was 130.0MB in the beginning and 467.7MB in the end (delta: 337.6MB). Free memory was 76.3MB in the beginning and 243.7MB in the end (delta: -167.4MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. * Witness Printer took 193.65ms. Allocated memory is still 467.7MB. Free memory was 243.7MB in the beginning and 232.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-11-20 17:10:12,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba9bb26-a7f2-47a9-acd9-103fb41e5c98/bin/ukojak-pZX7IvK2PQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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