./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:56:03,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:56:03,211 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:56:03,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:56:03,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:56:03,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:56:03,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:56:03,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:56:03,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:56:03,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:56:03,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:56:03,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:56:03,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:56:03,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:56:03,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:56:03,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:56:03,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:56:03,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:56:03,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:56:03,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:56:03,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:56:03,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:56:03,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:56:03,268 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:56:03,268 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:56:03,269 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:56:03,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:56:03,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:56:03,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:56:03,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:56:03,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:56:03,270 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:56:03,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:56:03,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2024-11-08 22:56:03,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:56:03,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:56:03,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:56:03,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:56:03,621 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:56:03,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursive/Fibonacci05.c Unable to find full path for "g++" [2024-11-08 22:56:05,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:56:05,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:56:05,739 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/sv-benchmarks/c/recursive/Fibonacci05.c [2024-11-08 22:56:05,749 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/data/24767d3c1/6dd8cf2c1f5048abaf78326d6a87f631/FLAG12c513059 [2024-11-08 22:56:05,773 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/data/24767d3c1/6dd8cf2c1f5048abaf78326d6a87f631 [2024-11-08 22:56:05,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:56:05,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:56:05,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:56:05,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:56:05,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:56:05,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:56:05" (1/1) ... [2024-11-08 22:56:05,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea20f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:05, skipping insertion in model container [2024-11-08 22:56:05,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:56:05" (1/1) ... [2024-11-08 22:56:05,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:56:05,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2024-11-08 22:56:05,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:56:06,011 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:56:06,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2024-11-08 22:56:06,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:56:06,040 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:56:06,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06 WrapperNode [2024-11-08 22:56:06,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:56:06,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:56:06,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:56:06,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:56:06,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,068 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-11-08 22:56:06,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:56:06,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:56:06,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:56:06,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:56:06,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:56:06,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:56:06,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:56:06,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:56:06,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:56:06,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:56:06,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:56:06,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:56:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-11-08 22:56:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-11-08 22:56:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:56:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:56:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:56:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:56:06,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:56:06,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:56:06,318 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 22:56:06,318 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:56:06,356 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:56:06,357 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 22:56:06,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:06 BoogieIcfgContainer [2024-11-08 22:56:06,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:56:06,358 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:56:06,358 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:56:06,367 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:56:06,367 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:06" (1/1) ... [2024-11-08 22:56:06,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:56:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2024-11-08 22:56:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-08 22:56:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:56:06,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2024-11-08 22:56:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-11-08 22:56:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:56:06,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:56:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2024-11-08 22:56:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2024-11-08 22:56:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:56:07,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:56:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2024-11-08 22:56:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-11-08 22:56:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:56:07,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 22:56:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2024-11-08 22:56:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2024-11-08 22:56:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 22:56:08,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 22:56:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 35 states and 56 transitions. [2024-11-08 22:56:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2024-11-08 22:56:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 22:56:09,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 22:56:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 42 states and 74 transitions. [2024-11-08 22:56:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2024-11-08 22:56:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 22:56:10,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 47 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 22:56:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 42 states and 73 transitions. [2024-11-08 22:56:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2024-11-08 22:56:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 22:56:10,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-08 22:56:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 49 states and 93 transitions. [2024-11-08 22:56:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 93 transitions. [2024-11-08 22:56:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 22:56:11,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-11-08 22:56:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 56 states and 116 transitions. [2024-11-08 22:56:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 116 transitions. [2024-11-08 22:56:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 22:56:12,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 302 proven. 338 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2024-11-08 22:56:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 56 states and 114 transitions. [2024-11-08 22:56:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2024-11-08 22:56:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 22:56:14,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:14,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 132 proven. 828 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2024-11-08 22:56:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 63 states and 138 transitions. [2024-11-08 22:56:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 138 transitions. [2024-11-08 22:56:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 22:56:15,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2917 backedges. 256 proven. 499 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2024-11-08 22:56:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 63 states and 137 transitions. [2024-11-08 22:56:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 137 transitions. [2024-11-08 22:56:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 22:56:16,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6077 backedges. 849 proven. 1075 refuted. 0 times theorem prover too weak. 4153 trivial. 0 not checked. [2024-11-08 22:56:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 63 states and 136 transitions. [2024-11-08 22:56:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 136 transitions. [2024-11-08 22:56:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-08 22:56:17,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6549 backedges. 237 proven. 1388 refuted. 0 times theorem prover too weak. 4924 trivial. 0 not checked. [2024-11-08 22:56:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 70 states and 162 transitions. [2024-11-08 22:56:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 162 transitions. [2024-11-08 22:56:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2024-11-08 22:56:19,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:19,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 32112 backedges. 1044 proven. 4402 refuted. 0 times theorem prover too weak. 26666 trivial. 0 not checked. [2024-11-08 22:56:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 72 states and 164 transitions. [2024-11-08 22:56:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 164 transitions. [2024-11-08 22:56:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2024-11-08 22:56:21,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1152 proven. 4761 refuted. 0 times theorem prover too weak. 23602 trivial. 0 not checked. [2024-11-08 22:56:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 74 states and 166 transitions. [2024-11-08 22:56:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 166 transitions. [2024-11-08 22:56:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-08 22:56:23,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:23,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 1314 proven. 412 refuted. 0 times theorem prover too weak. 11387 trivial. 0 not checked. [2024-11-08 22:56:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 74 states and 165 transitions. [2024-11-08 22:56:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 165 transitions. [2024-11-08 22:56:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2024-11-08 22:56:24,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 1971 proven. 4083 refuted. 0 times theorem prover too weak. 19211 trivial. 0 not checked. [2024-11-08 22:56:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 76 states and 167 transitions. [2024-11-08 22:56:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 167 transitions. [2024-11-08 22:56:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2024-11-08 22:56:26,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 27189 backedges. 734 proven. 3541 refuted. 0 times theorem prover too weak. 22914 trivial. 0 not checked. [2024-11-08 22:56:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 78 states and 169 transitions. [2024-11-08 22:56:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 169 transitions. [2024-11-08 22:56:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2024-11-08 22:56:27,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 1971 proven. 4083 refuted. 0 times theorem prover too weak. 19211 trivial. 0 not checked. [2024-11-08 22:56:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 78 states and 169 transitions. [2024-11-08 22:56:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 169 transitions. [2024-11-08 22:56:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-11-08 22:56:29,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1087 proven. 3186 refuted. 0 times theorem prover too weak. 12134 trivial. 0 not checked. [2024-11-08 22:56:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 78 states and 169 transitions. [2024-11-08 22:56:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 169 transitions. [2024-11-08 22:56:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-11-08 22:56:30,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16532 backedges. 597 proven. 2492 refuted. 0 times theorem prover too weak. 13443 trivial. 0 not checked. [2024-11-08 22:56:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 80 states and 171 transitions. [2024-11-08 22:56:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2024-11-08 22:56:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-11-08 22:56:32,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 865 proven. 3459 refuted. 0 times theorem prover too weak. 16667 trivial. 0 not checked. [2024-11-08 22:56:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 80 states and 171 transitions. [2024-11-08 22:56:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2024-11-08 22:56:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-11-08 22:56:33,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1662 proven. 3510 refuted. 0 times theorem prover too weak. 13931 trivial. 0 not checked. [2024-11-08 22:56:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 80 states and 171 transitions. [2024-11-08 22:56:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2024-11-08 22:56:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2024-11-08 22:56:34,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1152 proven. 4761 refuted. 0 times theorem prover too weak. 23602 trivial. 0 not checked. [2024-11-08 22:56:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 80 states and 171 transitions. [2024-11-08 22:56:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2024-11-08 22:56:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-11-08 22:56:36,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1087 proven. 3186 refuted. 0 times theorem prover too weak. 12134 trivial. 0 not checked. [2024-11-08 22:56:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 80 states and 171 transitions. [2024-11-08 22:56:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2024-11-08 22:56:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2024-11-08 22:56:37,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17304 backedges. 807 proven. 3081 refuted. 0 times theorem prover too weak. 13416 trivial. 0 not checked. [2024-11-08 22:56:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:56:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 80 states and 171 transitions. [2024-11-08 22:56:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 171 transitions. [2024-11-08 22:56:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-08 22:56:37,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:56:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:56:37,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:56:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:56:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:56:38,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:56:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:56:38,465 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 28 iterations. [2024-11-08 22:56:38,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:56:38 ImpRootNode [2024-11-08 22:56:38,586 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:56:38,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:56:38,587 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:56:38,587 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:56:38,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:06" (3/4) ... [2024-11-08 22:56:38,589 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:56:38,719 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:56:38,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:56:38,720 INFO L158 Benchmark]: Toolchain (without parser) took 32940.45ms. Allocated memory was 117.4MB in the beginning and 790.6MB in the end (delta: 673.2MB). Free memory was 81.4MB in the beginning and 321.0MB in the end (delta: -239.5MB). Peak memory consumption was 435.7MB. Max. memory is 16.1GB. [2024-11-08 22:56:38,720 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory was 86.4MB in the beginning and 86.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:56:38,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.01ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 69.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 22:56:38,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.22ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 67.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:56:38,722 INFO L158 Benchmark]: Boogie Preprocessor took 19.32ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 66.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:56:38,722 INFO L158 Benchmark]: RCFGBuilder took 267.47ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 56.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 22:56:38,723 INFO L158 Benchmark]: CodeCheck took 32228.06ms. Allocated memory was 117.4MB in the beginning and 790.6MB in the end (delta: 673.2MB). Free memory was 56.3MB in the beginning and 329.4MB in the end (delta: -273.0MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB. [2024-11-08 22:56:38,723 INFO L158 Benchmark]: Witness Printer took 132.23ms. Allocated memory is still 790.6MB. Free memory was 329.4MB in the beginning and 321.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 22:56:38,725 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.1s, OverallIterations: 28, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2752 SdHoareTripleChecker+Valid, 22.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1761 mSDsluCounter, 4136 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3109 mSDsCounter, 3310 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9739 IncrementalHoareTripleChecker+Invalid, 13049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3310 mSolverCounterUnsat, 1027 mSDtfsCounter, 9739 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28057 GetRequests, 26672 SyntacticMatches, 1213 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31023 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 10027 NumberOfCodeBlocks, 10027 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 9541 ConstructedInterpolants, 0 QuantifiedInterpolants, 12595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 2 PerfectInterpolantSequences, 260849/310456 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, 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] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, 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] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory was 86.4MB in the beginning and 86.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.01ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 69.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.22ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 67.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.32ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 66.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.47ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 56.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 32228.06ms. Allocated memory was 117.4MB in the beginning and 790.6MB in the end (delta: 673.2MB). Free memory was 56.3MB in the beginning and 329.4MB in the end (delta: -273.0MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB. * Witness Printer took 132.23ms. Allocated memory is still 790.6MB. Free memory was 329.4MB in the beginning and 321.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:56:38,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee0a4d62-3388-47e7-b14b-69403e4e54cc/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE