./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4 --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-2329fc7 [2022-12-15 01:28:09,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 01:28:09,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 01:28:09,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 01:28:09,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 01:28:09,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 01:28:09,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 01:28:09,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 01:28:09,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 01:28:09,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 01:28:09,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 01:28:09,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 01:28:09,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 01:28:09,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 01:28:09,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 01:28:09,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 01:28:09,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 01:28:09,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 01:28:09,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 01:28:09,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 01:28:09,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 01:28:09,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 01:28:09,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 01:28:09,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 01:28:09,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 01:28:09,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 01:28:09,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 01:28:09,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 01:28:09,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 01:28:09,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 01:28:09,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 01:28:09,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 01:28:09,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 01:28:09,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 01:28:09,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 01:28:09,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 01:28:09,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 01:28:09,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 01:28:09,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 01:28:09,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 01:28:09,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 01:28:09,380 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 01:28:09,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 01:28:09,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 01:28:09,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 01:28:09,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 01:28:09,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 01:28:09,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 01:28:09,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 01:28:09,399 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 01:28:09,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 01:28:09,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 01:28:09,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 01:28:09,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 01:28:09,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 01:28:09,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 01:28:09,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 01:28:09,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 01:28:09,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 01:28:09,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 01:28:09,405 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 01:28:09,405 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 01:28:09,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 01:28:09,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 01:28:09,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 01:28:09,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 01:28:09,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 01:28:09,405 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 01:28:09,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 01:28:09,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 01:28:09,406 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_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/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_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4 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-12-15 01:28:09,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 01:28:09,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 01:28:09,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 01:28:09,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 01:28:09,587 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 01:28:09,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/recursive/Fibonacci05.c [2022-12-15 01:28:12,103 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 01:28:12,256 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 01:28:12,257 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/sv-benchmarks/c/recursive/Fibonacci05.c [2022-12-15 01:28:12,261 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/data/5657ae12f/cd25c4ff343146d6a3be6f122344963a/FLAG001a91785 [2022-12-15 01:28:12,273 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/data/5657ae12f/cd25c4ff343146d6a3be6f122344963a [2022-12-15 01:28:12,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 01:28:12,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 01:28:12,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 01:28:12,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 01:28:12,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 01:28:12,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d623a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12, skipping insertion in model container [2022-12-15 01:28:12,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 01:28:12,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 01:28:12,436 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-12-15 01:28:12,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 01:28:12,449 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 01:28:12,462 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-12-15 01:28:12,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 01:28:12,475 INFO L208 MainTranslator]: Completed translation [2022-12-15 01:28:12,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12 WrapperNode [2022-12-15 01:28:12,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 01:28:12,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 01:28:12,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 01:28:12,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 01:28:12,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,509 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-12-15 01:28:12,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 01:28:12,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 01:28:12,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 01:28:12,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 01:28:12,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,524 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 01:28:12,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 01:28:12,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 01:28:12,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 01:28:12,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 01:28:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 01:28:12,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 01:28:12,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 01:28:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-12-15 01:28:12,590 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-12-15 01:28:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 01:28:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 01:28:12,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 01:28:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 01:28:12,647 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 01:28:12,648 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 01:28:12,723 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 01:28:12,733 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 01:28:12,734 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-15 01:28:12,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:28:12 BoogieIcfgContainer [2022-12-15 01:28:12,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 01:28:12,736 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 01:28:12,736 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 01:28:12,743 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 01:28:12,743 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:28:12" (1/1) ... [2022-12-15 01:28:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 01:28:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2022-12-15 01:28:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-12-15 01:28:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-15 01:28:12,793 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:28:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2022-12-15 01:28:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2022-12-15 01:28:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-15 01:28:13,013 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:28:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2022-12-15 01:28:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-12-15 01:28:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 01:28:13,206 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-15 01:28:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2022-12-15 01:28:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-12-15 01:28:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 01:28:13,397 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:28:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2022-12-15 01:28:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2022-12-15 01:28:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 01:28:13,689 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 01:28:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 35 states and 56 transitions. [2022-12-15 01:28:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2022-12-15 01:28:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 01:28:14,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 01:28:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 42 states and 74 transitions. [2022-12-15 01:28:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2022-12-15 01:28:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-15 01:28:14,563 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 47 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-15 01:28:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 42 states and 73 transitions. [2022-12-15 01:28:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2022-12-15 01:28:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-15 01:28:14,901 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-15 01:28:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 49 states and 93 transitions. [2022-12-15 01:28:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 93 transitions. [2022-12-15 01:28:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 01:28:15,334 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 69 proven. 421 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2022-12-15 01:28:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 56 states and 116 transitions. [2022-12-15 01:28:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 116 transitions. [2022-12-15 01:28:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-15 01:28:15,960 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 193 proven. 204 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-12-15 01:28:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 56 states and 115 transitions. [2022-12-15 01:28:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 115 transitions. [2022-12-15 01:28:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 01:28:16,397 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 302 proven. 338 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2022-12-15 01:28:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 56 states and 113 transitions. [2022-12-15 01:28:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2022-12-15 01:28:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-15 01:28:16,876 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2022-12-15 01:28:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 63 states and 137 transitions. [2022-12-15 01:28:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 137 transitions. [2022-12-15 01:28:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-12-15 01:28:17,476 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6077 backedges. 849 proven. 1075 refuted. 0 times theorem prover too weak. 4153 trivial. 0 not checked. [2022-12-15 01:28:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 63 states and 136 transitions. [2022-12-15 01:28:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 136 transitions. [2022-12-15 01:28:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-12-15 01:28:18,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9549 backedges. 297 proven. 1714 refuted. 0 times theorem prover too weak. 7538 trivial. 0 not checked. [2022-12-15 01:28:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 70 states and 162 transitions. [2022-12-15 01:28:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 162 transitions. [2022-12-15 01:28:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2022-12-15 01:28:19,187 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:19,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22149 backedges. 1300 proven. 3753 refuted. 0 times theorem prover too weak. 17096 trivial. 0 not checked. [2022-12-15 01:28:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 72 states and 164 transitions. [2022-12-15 01:28:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 164 transitions. [2022-12-15 01:28:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2022-12-15 01:28:20,437 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 27189 backedges. 734 proven. 3541 refuted. 0 times theorem prover too weak. 22914 trivial. 0 not checked. [2022-12-15 01:28:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 74 states and 166 transitions. [2022-12-15 01:28:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 166 transitions. [2022-12-15 01:28:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-12-15 01:28:21,223 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2022-12-15 01:28:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 76 states and 168 transitions. [2022-12-15 01:28:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 168 transitions. [2022-12-15 01:28:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2022-12-15 01:28:22,195 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 1247 proven. 321 refuted. 0 times theorem prover too weak. 9379 trivial. 0 not checked. [2022-12-15 01:28:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 76 states and 167 transitions. [2022-12-15 01:28:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 167 transitions. [2022-12-15 01:28:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2022-12-15 01:28:22,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16532 backedges. 597 proven. 2492 refuted. 0 times theorem prover too weak. 13443 trivial. 0 not checked. [2022-12-15 01:28:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 78 states and 169 transitions. [2022-12-15 01:28:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 169 transitions. [2022-12-15 01:28:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2022-12-15 01:28:23,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 17304 backedges. 807 proven. 3081 refuted. 0 times theorem prover too weak. 13416 trivial. 0 not checked. [2022-12-15 01:28:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 80 states and 171 transitions. [2022-12-15 01:28:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2022-12-15 01:28:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2022-12-15 01:28:23,876 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 45069 backedges. 983 proven. 5545 refuted. 0 times theorem prover too weak. 38541 trivial. 0 not checked. [2022-12-15 01:28:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 80 states and 171 transitions. [2022-12-15 01:28:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2022-12-15 01:28:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2022-12-15 01:28:24,812 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 903 proven. 3865 refuted. 0 times theorem prover too weak. 20342 trivial. 0 not checked. [2022-12-15 01:28:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 80 states and 171 transitions. [2022-12-15 01:28:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2022-12-15 01:28:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-12-15 01:28:25,463 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2022-12-15 01:28:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 80 states and 171 transitions. [2022-12-15 01:28:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2022-12-15 01:28:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-12-15 01:28:26,172 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:26,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2022-12-15 01:28:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 80 states and 171 transitions. [2022-12-15 01:28:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2022-12-15 01:28:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-12-15 01:28:26,987 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2022-12-15 01:28:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 80 states and 171 transitions. [2022-12-15 01:28:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2022-12-15 01:28:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-12-15 01:28:27,675 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:28:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2022-12-15 01:28:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:28:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 80 states and 171 transitions. [2022-12-15 01:28:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2022-12-15 01:28:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2022-12-15 01:28:28,463 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:28:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:28:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:28:28,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 01:28:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:28:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:28:28,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 01:28:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:28:28,859 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 27 iterations. [2022-12-15 01:28:28,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 01:28:28 ImpRootNode [2022-12-15 01:28:28,941 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 01:28:28,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 01:28:28,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 01:28:28,942 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 01:28:28,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:28:12" (3/4) ... [2022-12-15 01:28:28,943 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 01:28:29,052 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 01:28:29,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 01:28:29,053 INFO L158 Benchmark]: Toolchain (without parser) took 16777.63ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 112.3MB in the beginning and 589.1MB in the end (delta: -476.8MB). Peak memory consumption was 380.9MB. Max. memory is 16.1GB. [2022-12-15 01:28:29,054 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 01:28:29,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.90ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 102.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-15 01:28:29,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.11ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 01:28:29,055 INFO L158 Benchmark]: Boogie Preprocessor took 16.38ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 987.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 01:28:29,055 INFO L158 Benchmark]: RCFGBuilder took 208.93ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 89.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-15 01:28:29,055 INFO L158 Benchmark]: CodeCheck took 16204.76ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 89.4MB in the beginning and 225.8MB in the end (delta: -136.4MB). Peak memory consumption was 351.6MB. Max. memory is 16.1GB. [2022-12-15 01:28:29,056 INFO L158 Benchmark]: Witness Printer took 111.46ms. Allocated memory is still 629.1MB. Free memory was 225.8MB in the beginning and 589.1MB in the end (delta: -363.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-15 01:28:29,057 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: 16.1s, OverallIterations: 27, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3759 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1668 mSDsluCounter, 3918 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2940 mSDsCounter, 3137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9145 IncrementalHoareTripleChecker+Invalid, 12282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3137 mSolverCounterUnsat, 978 mSDtfsCounter, 9145 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25686 GetRequests, 25338 SyntacticMatches, 176 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28226 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 9238 NumberOfCodeBlocks, 9238 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 8753 ConstructedInterpolants, 0 QuantifiedInterpolants, 11943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 237210/281983 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.17ms. Allocated memory is still 142.6MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.90ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 102.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.11ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.38ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 987.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 208.93ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 89.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 16204.76ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 89.4MB in the beginning and 225.8MB in the end (delta: -136.4MB). Peak memory consumption was 351.6MB. Max. memory is 16.1GB. * Witness Printer took 111.46ms. Allocated memory is still 629.1MB. Free memory was 225.8MB in the beginning and 589.1MB in the end (delta: -363.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 01:28:29,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_320f2041-06a2-4b77-b8a7-8e55000baa87/bin/ukojak-rkRKPMF4O4/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