./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18ab16c8226f43cf595901df83a1f895912e466b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 22:42:12,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 22:42:12,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 22:42:12,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 22:42:12,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 22:42:12,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 22:42:12,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 22:42:12,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 22:42:12,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 22:42:12,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 22:42:12,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 22:42:12,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 22:42:12,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 22:42:12,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 22:42:12,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 22:42:12,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 22:42:12,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 22:42:12,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 22:42:12,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 22:42:12,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 22:42:12,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 22:42:12,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 22:42:12,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 22:42:12,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 22:42:12,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 22:42:12,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 22:42:12,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 22:42:12,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 22:42:12,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 22:42:12,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 22:42:12,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 22:42:12,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 22:42:12,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 22:42:12,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 22:42:12,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 22:42:12,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 22:42:12,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 22:42:12,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 22:42:12,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 22:42:12,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 22:42:12,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 22:42:12,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-29 22:42:12,332 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 22:42:12,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 22:42:12,333 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-29 22:42:12,333 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-29 22:42:12,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 22:42:12,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 22:42:12,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 22:42:12,335 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 22:42:12,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 22:42:12,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 22:42:12,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 22:42:12,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 22:42:12,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 22:42:12,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 22:42:12,337 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 22:42:12,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 22:42:12,337 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 22:42:12,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 22:42:12,338 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-29 22:42:12,338 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-29 22:42:12,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 22:42:12,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 22:42:12,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-29 22:42:12,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 22:42:12,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 22:42:12,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 22:42:12,340 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-29 22:42:12,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 22:42:12,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 22:42:12,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18ab16c8226f43cf595901df83a1f895912e466b [2020-11-29 22:42:12,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 22:42:12,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 22:42:12,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 22:42:12,657 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 22:42:12,660 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 22:42:12,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/../../sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-29 22:42:12,763 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/data/372f84e22/03116a22c8454005b0ba700992e0f08b/FLAG1442b482a [2020-11-29 22:42:13,318 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 22:42:13,319 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-29 22:42:13,328 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/data/372f84e22/03116a22c8454005b0ba700992e0f08b/FLAG1442b482a [2020-11-29 22:42:13,677 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/data/372f84e22/03116a22c8454005b0ba700992e0f08b [2020-11-29 22:42:13,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 22:42:13,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 22:42:13,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 22:42:13,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 22:42:13,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 22:42:13,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:42:13" (1/1) ... [2020-11-29 22:42:13,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fa827b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:13, skipping insertion in model container [2020-11-29 22:42:13,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:42:13" (1/1) ... [2020-11-29 22:42:13,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 22:42:13,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 22:42:13,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:42:13,989 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 22:42:14,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:42:14,023 INFO L208 MainTranslator]: Completed translation [2020-11-29 22:42:14,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14 WrapperNode [2020-11-29 22:42:14,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 22:42:14,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 22:42:14,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 22:42:14,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 22:42:14,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 22:42:14,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 22:42:14,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 22:42:14,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 22:42:14,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 22:42:14,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 22:42:14,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 22:42:14,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 22:42:14,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:42:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-29 22:42:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-29 22:42:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-29 22:42:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 22:42:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 22:42:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 22:42:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 22:42:14,508 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 22:42:14,508 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-29 22:42:14,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:42:14 BoogieIcfgContainer [2020-11-29 22:42:14,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 22:42:14,512 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-29 22:42:14,512 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-29 22:42:14,527 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-29 22:42:14,527 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:42:14" (1/1) ... [2020-11-29 22:42:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:42:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2020-11-29 22:42:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-11-29 22:42:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 22:42:14,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:42:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2020-11-29 22:42:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-11-29 22:42:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 22:42:15,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:42:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2020-11-29 22:42:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-11-29 22:42:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 22:42:15,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 22:42:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2020-11-29 22:42:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-11-29 22:42:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 22:42:15,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 22:42:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2020-11-29 22:42:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2020-11-29 22:42:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 22:42:16,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-29 22:42:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 35 states and 57 transitions. [2020-11-29 22:42:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2020-11-29 22:42:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 22:42:17,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 22:42:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 42 states and 76 transitions. [2020-11-29 22:42:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 76 transitions. [2020-11-29 22:42:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 22:42:18,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-29 22:42:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 42 states and 75 transitions. [2020-11-29 22:42:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 75 transitions. [2020-11-29 22:42:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 22:42:18,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-29 22:42:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 49 states and 96 transitions. [2020-11-29 22:42:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 96 transitions. [2020-11-29 22:42:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-29 22:42:19,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 54 proven. 273 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-11-29 22:42:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 56 states and 120 transitions. [2020-11-29 22:42:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 120 transitions. [2020-11-29 22:42:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-29 22:42:20,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 195 proven. 202 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2020-11-29 22:42:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 56 states and 119 transitions. [2020-11-29 22:42:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 119 transitions. [2020-11-29 22:42:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-11-29 22:42:21,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 142 proven. 942 refuted. 0 times theorem prover too weak. 3029 trivial. 0 not checked. [2020-11-29 22:42:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 63 states and 146 transitions. [2020-11-29 22:42:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 146 transitions. [2020-11-29 22:42:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2020-11-29 22:42:22,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9549 backedges. 297 proven. 1714 refuted. 0 times theorem prover too weak. 7538 trivial. 0 not checked. [2020-11-29 22:42:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 70 states and 176 transitions. [2020-11-29 22:42:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 176 transitions. [2020-11-29 22:42:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2020-11-29 22:42:24,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 17241 backedges. 1561 proven. 435 refuted. 0 times theorem prover too weak. 15245 trivial. 0 not checked. [2020-11-29 22:42:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 70 states and 172 transitions. [2020-11-29 22:42:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 172 transitions. [2020-11-29 22:42:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2020-11-29 22:42:25,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19238 backedges. 952 proven. 1166 refuted. 0 times theorem prover too weak. 17120 trivial. 0 not checked. [2020-11-29 22:42:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 70 states and 169 transitions. [2020-11-29 22:42:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 169 transitions. [2020-11-29 22:42:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2020-11-29 22:42:26,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32112 backedges. 906 proven. 3765 refuted. 0 times theorem prover too weak. 27441 trivial. 0 not checked. [2020-11-29 22:42:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 72 states and 171 transitions. [2020-11-29 22:42:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 171 transitions. [2020-11-29 22:42:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2020-11-29 22:42:27,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 901 proven. 3867 refuted. 0 times theorem prover too weak. 20342 trivial. 0 not checked. [2020-11-29 22:42:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 74 states and 173 transitions. [2020-11-29 22:42:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 173 transitions. [2020-11-29 22:42:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2020-11-29 22:42:29,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22968 backedges. 939 proven. 4214 refuted. 0 times theorem prover too weak. 17815 trivial. 0 not checked. [2020-11-29 22:42:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 76 states and 175 transitions. [2020-11-29 22:42:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 175 transitions. [2020-11-29 22:42:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2020-11-29 22:42:30,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1005 proven. 4908 refuted. 0 times theorem prover too weak. 23602 trivial. 0 not checked. [2020-11-29 22:42:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 76 states and 175 transitions. [2020-11-29 22:42:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 175 transitions. [2020-11-29 22:42:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2020-11-29 22:42:31,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16532 backedges. 598 proven. 2491 refuted. 0 times theorem prover too weak. 13443 trivial. 0 not checked. [2020-11-29 22:42:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 78 states and 177 transitions. [2020-11-29 22:42:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-11-29 22:42:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2020-11-29 22:42:32,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15594 backedges. 520 proven. 1374 refuted. 0 times theorem prover too weak. 13700 trivial. 0 not checked. [2020-11-29 22:42:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 78 states and 175 transitions. [2020-11-29 22:42:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 175 transitions. [2020-11-29 22:42:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2020-11-29 22:42:33,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 845 proven. 3923 refuted. 0 times theorem prover too weak. 20342 trivial. 0 not checked. [2020-11-29 22:42:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 78 states and 175 transitions. [2020-11-29 22:42:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 175 transitions. [2020-11-29 22:42:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2020-11-29 22:42:34,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2020-11-29 22:42:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 80 states and 177 transitions. [2020-11-29 22:42:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 177 transitions. [2020-11-29 22:42:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2020-11-29 22:42:35,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17304 backedges. 805 proven. 3083 refuted. 0 times theorem prover too weak. 13416 trivial. 0 not checked. [2020-11-29 22:42:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:42:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 80 states and 177 transitions. [2020-11-29 22:42:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 177 transitions. [2020-11-29 22:42:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2020-11-29 22:42:36,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:42:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:42:36,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:42:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:42:36,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:42:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:42:37,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:42:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:42:37,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:42:37,517 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 24 iterations. [2020-11-29 22:42:37,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.11 10:42:37 ImpRootNode [2020-11-29 22:42:37,901 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-29 22:42:37,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 22:42:37,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 22:42:37,902 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 22:42:37,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:42:14" (3/4) ... [2020-11-29 22:42:37,905 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 22:42:38,144 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f51a9056-9b7d-454b-b888-be76978a17ee/bin/ukojak/witness.graphml [2020-11-29 22:42:38,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 22:42:38,147 INFO L168 Benchmark]: Toolchain (without parser) took 24460.43 ms. Allocated memory was 83.9 MB in the beginning and 887.1 MB in the end (delta: 803.2 MB). Free memory was 50.1 MB in the beginning and 803.5 MB in the end (delta: -753.4 MB). Peak memory consumption was 49.2 MB. Max. memory is 16.1 GB. [2020-11-29 22:42:38,148 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 83.9 MB. Free memory was 56.4 MB in the beginning and 56.4 MB in the end (delta: 28.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:42:38,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.18 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 50.0 MB in the beginning and 80.2 MB in the end (delta: -30.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-11-29 22:42:38,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.27 ms. Allocated memory is still 102.8 MB. Free memory was 80.2 MB in the beginning and 78.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:42:38,149 INFO L168 Benchmark]: Boogie Preprocessor took 20.60 ms. Allocated memory is still 102.8 MB. Free memory was 78.8 MB in the beginning and 78.0 MB in the end (delta: 787.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 22:42:38,150 INFO L168 Benchmark]: RCFGBuilder took 428.12 ms. Allocated memory is still 102.8 MB. Free memory was 77.7 MB in the beginning and 64.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 22:42:38,151 INFO L168 Benchmark]: CodeCheck took 23389.37 ms. Allocated memory was 102.8 MB in the beginning and 887.1 MB in the end (delta: 784.3 MB). Free memory was 64.5 MB in the beginning and 822.4 MB in the end (delta: -757.8 MB). Peak memory consumption was 519.9 MB. Max. memory is 16.1 GB. [2020-11-29 22:42:38,151 INFO L168 Benchmark]: Witness Printer took 242.44 ms. Allocated memory is still 887.1 MB. Free memory was 822.4 MB in the beginning and 803.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 22:42:38,156 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. VerificationResult: UNSAFE, OverallTime: 22.9s, OverallIterations: 24, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 61865832 SDtfs, 65675112 SDslu, 104611536 SDs, 0 SdLazy, 283749524 SolverSat, 80419988 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22992 GetRequests, 22014 SyntacticMatches, 812 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18416 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 8242 NumberOfCodeBlocks, 8242 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 7760 ConstructedInterpolants, 0 QuantifiedInterpolants, 5229788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 219369/255392 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: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 83.9 MB. Free memory was 56.4 MB in the beginning and 56.4 MB in the end (delta: 28.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 334.18 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 50.0 MB in the beginning and 80.2 MB in the end (delta: -30.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.27 ms. Allocated memory is still 102.8 MB. Free memory was 80.2 MB in the beginning and 78.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.60 ms. Allocated memory is still 102.8 MB. Free memory was 78.8 MB in the beginning and 78.0 MB in the end (delta: 787.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 428.12 ms. Allocated memory is still 102.8 MB. Free memory was 77.7 MB in the beginning and 64.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * CodeCheck took 23389.37 ms. Allocated memory was 102.8 MB in the beginning and 887.1 MB in the end (delta: 784.3 MB). Free memory was 64.5 MB in the beginning and 822.4 MB in the end (delta: -757.8 MB). Peak memory consumption was 519.9 MB. Max. memory is 16.1 GB. * Witness Printer took 242.44 ms. Allocated memory is still 887.1 MB. Free memory was 822.4 MB in the beginning and 803.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...