./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 dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB --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-dbf71c6-m [2022-10-17 16:33:04,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 16:33:04,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 16:33:04,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 16:33:04,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 16:33:04,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 16:33:04,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 16:33:04,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 16:33:04,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 16:33:04,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 16:33:04,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 16:33:04,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 16:33:04,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 16:33:04,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 16:33:04,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 16:33:04,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 16:33:04,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 16:33:04,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 16:33:04,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 16:33:04,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 16:33:04,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 16:33:04,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 16:33:04,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 16:33:04,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 16:33:04,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 16:33:04,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 16:33:04,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 16:33:04,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 16:33:04,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 16:33:04,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 16:33:04,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 16:33:04,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 16:33:04,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 16:33:04,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 16:33:04,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 16:33:04,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 16:33:04,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 16:33:04,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 16:33:04,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 16:33:04,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 16:33:04,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 16:33:04,193 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-10-17 16:33:04,243 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 16:33:04,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 16:33:04,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 16:33:04,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-10-17 16:33:04,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 16:33:04,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 16:33:04,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 16:33:04,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 16:33:04,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 16:33:04,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 16:33:04,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 16:33:04,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 16:33:04,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 16:33:04,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 16:33:04,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 16:33:04,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 16:33:04,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 16:33:04,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 16:33:04,254 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-10-17 16:33:04,254 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-10-17 16:33:04,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 16:33:04,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-10-17 16:33:04,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 16:33:04,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 16:33:04,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 16:33:04,256 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-10-17 16:33:04,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 16:33:04,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 16:33:04,257 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_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/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_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB 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-10-17 16:33:04,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 16:33:04,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 16:33:04,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 16:33:04,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 16:33:04,612 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 16:33:04,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/../../sv-benchmarks/c/recursive/Fibonacci05.c [2022-10-17 16:33:04,706 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/data/a16f198e1/debfcf54e6dd4a59a401225e5370795f/FLAG404f0c586 [2022-10-17 16:33:05,216 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 16:33:05,218 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/sv-benchmarks/c/recursive/Fibonacci05.c [2022-10-17 16:33:05,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/data/a16f198e1/debfcf54e6dd4a59a401225e5370795f/FLAG404f0c586 [2022-10-17 16:33:05,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/data/a16f198e1/debfcf54e6dd4a59a401225e5370795f [2022-10-17 16:33:05,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 16:33:05,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 16:33:05,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 16:33:05,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 16:33:05,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 16:33:05,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fedb59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05, skipping insertion in model container [2022-10-17 16:33:05,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 16:33:05,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 16:33:05,822 WARN L230 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_1ef3f863-f185-43d3-a601-cdd0580b69c0/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-10-17 16:33:05,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 16:33:05,833 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 16:33:05,847 WARN L230 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_1ef3f863-f185-43d3-a601-cdd0580b69c0/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-10-17 16:33:05,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 16:33:05,859 INFO L208 MainTranslator]: Completed translation [2022-10-17 16:33:05,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05 WrapperNode [2022-10-17 16:33:05,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 16:33:05,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 16:33:05,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 16:33:05,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 16:33:05,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,893 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-10-17 16:33:05,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 16:33:05,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 16:33:05,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 16:33:05,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 16:33:05,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 16:33:05,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 16:33:05,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 16:33:05,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 16:33:05,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:33:05" (1/1) ... [2022-10-17 16:33:05,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-10-17 16:33:05,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/z3 [2022-10-17 16:33:05,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-10-17 16:33:05,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-10-17 16:33:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-10-17 16:33:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-10-17 16:33:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 16:33:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 16:33:05,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 16:33:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 16:33:06,045 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 16:33:06,047 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 16:33:06,161 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 16:33:06,180 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 16:33:06,180 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 16:33:06,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:33:06 BoogieIcfgContainer [2022-10-17 16:33:06,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 16:33:06,184 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-10-17 16:33:06,185 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-10-17 16:33:06,195 INFO L275 PluginConnector]: CodeCheck initialized [2022-10-17 16:33:06,196 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:33:06" (1/1) ... [2022-10-17 16:33:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 16:33:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2022-10-17 16:33:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-10-17 16:33:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-17 16:33:06,273 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:33:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2022-10-17 16:33:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-10-17 16:33:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-17 16:33:06,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:06,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:33:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2022-10-17 16:33:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-10-17 16:33:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-17 16:33:07,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 16:33:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2022-10-17 16:33:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-10-17 16:33:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 16:33:07,360 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:07,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 16:33:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2022-10-17 16:33:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2022-10-17 16:33:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-17 16:33:07,842 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-17 16:33:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 35 states and 56 transitions. [2022-10-17 16:33:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2022-10-17 16:33:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-17 16:33:08,738 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-17 16:33:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 42 states and 74 transitions. [2022-10-17 16:33:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2022-10-17 16:33:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-17 16:33:09,383 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 47 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-17 16:33:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 42 states and 73 transitions. [2022-10-17 16:33:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2022-10-17 16:33:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-17 16:33:10,119 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-10-17 16:33:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 49 states and 93 transitions. [2022-10-17 16:33:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 93 transitions. [2022-10-17 16:33:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-10-17 16:33:10,899 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 54 proven. 273 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-10-17 16:33:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 56 states and 116 transitions. [2022-10-17 16:33:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 116 transitions. [2022-10-17 16:33:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-17 16:33:11,814 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:11,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 193 proven. 204 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-10-17 16:33:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 56 states and 115 transitions. [2022-10-17 16:33:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 115 transitions. [2022-10-17 16:33:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-10-17 16:33:12,527 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 102 proven. 456 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2022-10-17 16:33:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 63 states and 141 transitions. [2022-10-17 16:33:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 141 transitions. [2022-10-17 16:33:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-10-17 16:33:13,625 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:13,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 161 proven. 612 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2022-10-17 16:33:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 70 states and 170 transitions. [2022-10-17 16:33:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 170 transitions. [2022-10-17 16:33:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2022-10-17 16:33:14,822 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 847 proven. 3921 refuted. 0 times theorem prover too weak. 20342 trivial. 0 not checked. [2022-10-17 16:33:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 72 states and 172 transitions. [2022-10-17 16:33:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 172 transitions. [2022-10-17 16:33:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-10-17 16:33:17,343 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6549 backedges. 1052 proven. 747 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2022-10-17 16:33:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 74 states and 171 transitions. [2022-10-17 16:33:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 171 transitions. [2022-10-17 16:33:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2022-10-17 16:33:18,857 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22968 backedges. 940 proven. 4213 refuted. 0 times theorem prover too weak. 17815 trivial. 0 not checked. [2022-10-17 16:33:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 76 states and 173 transitions. [2022-10-17 16:33:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 173 transitions. [2022-10-17 16:33:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-10-17 16:33:20,968 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 14031 backedges. 802 proven. 990 refuted. 0 times theorem prover too weak. 12239 trivial. 0 not checked. [2022-10-17 16:33:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 76 states and 170 transitions. [2022-10-17 16:33:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 170 transitions. [2022-10-17 16:33:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2022-10-17 16:33:21,812 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:21,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 822 proven. 970 refuted. 0 times theorem prover too weak. 5328 trivial. 0 not checked. [2022-10-17 16:33:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 76 states and 168 transitions. [2022-10-17 16:33:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 168 transitions. [2022-10-17 16:33:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-10-17 16:33:22,880 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2022-10-17 16:33:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 78 states and 170 transitions. [2022-10-17 16:33:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 170 transitions. [2022-10-17 16:33:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-10-17 16:33:24,864 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:33:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2022-10-17 16:33:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:33:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 78 states and 170 transitions. [2022-10-17 16:33:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 170 transitions. [2022-10-17 16:33:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2022-10-17 16:33:26,561 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:33:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:33:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:33:26,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 16:33:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:33:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:33:27,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 16:33:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:33:27,287 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 20 iterations. [2022-10-17 16:33:27,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 17.10 04:33:27 ImpRootNode [2022-10-17 16:33:27,483 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-10-17 16:33:27,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 16:33:27,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 16:33:27,485 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 16:33:27,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:33:06" (3/4) ... [2022-10-17 16:33:27,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 16:33:27,655 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/witness.graphml [2022-10-17 16:33:27,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 16:33:27,656 INFO L158 Benchmark]: Toolchain (without parser) took 22062.72ms. Allocated memory was 94.4MB in the beginning and 444.6MB in the end (delta: 350.2MB). Free memory was 57.1MB in the beginning and 295.5MB in the end (delta: -238.5MB). Peak memory consumption was 111.2MB. Max. memory is 16.1GB. [2022-10-17 16:33:27,657 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 94.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 16:33:27,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.02ms. Allocated memory is still 94.4MB. Free memory was 57.0MB in the beginning and 70.2MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 16:33:27,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.69ms. Allocated memory is still 94.4MB. Free memory was 69.8MB in the beginning and 68.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 16:33:27,658 INFO L158 Benchmark]: Boogie Preprocessor took 18.40ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 67.6MB in the end (delta: 822.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 16:33:27,659 INFO L158 Benchmark]: RCFGBuilder took 269.98ms. Allocated memory is still 94.4MB. Free memory was 67.6MB in the beginning and 57.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 16:33:27,659 INFO L158 Benchmark]: CodeCheck took 21299.21ms. Allocated memory was 94.4MB in the beginning and 444.6MB in the end (delta: 350.2MB). Free memory was 57.6MB in the beginning and 306.0MB in the end (delta: -248.4MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2022-10-17 16:33:27,660 INFO L158 Benchmark]: Witness Printer took 171.45ms. Allocated memory is still 444.6MB. Free memory was 306.0MB in the beginning and 295.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 16:33:27,662 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: 21.1s, OverallIterations: 20, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2403 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1059 mSDsluCounter, 2458 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1841 mSDsCounter, 1997 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5992 IncrementalHoareTripleChecker+Invalid, 7989 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1997 mSolverCounterUnsat, 617 mSDtfsCounter, 5992 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15367 GetRequests, 15059 SyntacticMatches, 138 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19396 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 4875 NumberOfCodeBlocks, 4875 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4397 ConstructedInterpolants, 0 QuantifiedInterpolants, 6283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 2 PerfectInterpolantSequences, 99635/119198 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.37ms. Allocated memory is still 94.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.02ms. Allocated memory is still 94.4MB. Free memory was 57.0MB in the beginning and 70.2MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.69ms. Allocated memory is still 94.4MB. Free memory was 69.8MB in the beginning and 68.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.40ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 67.6MB in the end (delta: 822.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 269.98ms. Allocated memory is still 94.4MB. Free memory was 67.6MB in the beginning and 57.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 21299.21ms. Allocated memory was 94.4MB in the beginning and 444.6MB in the end (delta: 350.2MB). Free memory was 57.6MB in the beginning and 306.0MB in the end (delta: -248.4MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. * Witness Printer took 171.45ms. Allocated memory is still 444.6MB. Free memory was 306.0MB in the beginning and 295.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-10-17 16:33:27,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ef3f863-f185-43d3-a601-cdd0580b69c0/bin/ukojak-92XMlrwhuB/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