./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/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_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/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_75129e07-f757-4815-a7ee-e53191dc874c/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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:24:51,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:24:51,207 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:24:51,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:24:51,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:24:51,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:24:51,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:24:51,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:24:51,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:24:51,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:24:51,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:24:51,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:24:51,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:24:51,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:24:51,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:24:51,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:24:51,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:24:51,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:24:51,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:24:51,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:24:51,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:24:51,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:24:51,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:24:51,250 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:24:51,251 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:24:51,251 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:24:51,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:24:51,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:24:51,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:24:51,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:24:51,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:24:51,254 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:24:51,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:24:51,255 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_75129e07-f757-4815-a7ee-e53191dc874c/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_75129e07-f757-4815-a7ee-e53191dc874c/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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2024-11-08 19:24:51,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:24:51,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:24:51,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:24:51,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:24:51,564 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:24:51,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c Unable to find full path for "g++" [2024-11-08 19:24:53,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:24:53,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:24:53,911 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-08 19:24:53,920 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/data/8fe70972f/94bab8fa1a214e98ba0d329d1bffd704/FLAGb3983a51d [2024-11-08 19:24:53,942 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/data/8fe70972f/94bab8fa1a214e98ba0d329d1bffd704 [2024-11-08 19:24:53,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:24:53,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:24:53,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:53,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:24:53,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:24:53,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:53" (1/1) ... [2024-11-08 19:24:53,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3562a304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:53, skipping insertion in model container [2024-11-08 19:24:53,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:53" (1/1) ... [2024-11-08 19:24:53,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:24:54,168 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_75129e07-f757-4815-a7ee-e53191dc874c/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2024-11-08 19:24:54,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:54,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:24:54,197 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_75129e07-f757-4815-a7ee-e53191dc874c/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2024-11-08 19:24:54,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:54,214 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:24:54,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54 WrapperNode [2024-11-08 19:24:54,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:54,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:54,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:24:54,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:24:54,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,247 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-08 19:24:54,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:54,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:24:54,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:24:54,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:24:54,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:24:54,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:24:54,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:24:54,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:24:54,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:24:54,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:24:54,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:24:54,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-08 19:24:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-08 19:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-08 19:24:54,350 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-08 19:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:24:54,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:24:54,443 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:24:54,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:24:54,660 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:24:54,660 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:24:54,705 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:24:54,705 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:24:54,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:54 BoogieIcfgContainer [2024-11-08 19:24:54,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:24:54,707 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:24:54,707 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:24:54,720 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:24:54,720 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:54" (1/1) ... [2024-11-08 19:24:54,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2024-11-08 19:24:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-08 19:24:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:24:54,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:55,127 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 19:24:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2024-11-08 19:24:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-08 19:24:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:24:55,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:55,439 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 19:24:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2024-11-08 19:24:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-11-08 19:24:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:24:55,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:24:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2024-11-08 19:24:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-11-08 19:24:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:24:56,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:24:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2024-11-08 19:24:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2024-11-08 19:24:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 19:24:57,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:24:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2024-11-08 19:24:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-11-08 19:24:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:24:58,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:24:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 45 states and 66 transitions. [2024-11-08 19:24:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-11-08 19:24:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:24:59,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:25:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 57 states and 95 transitions. [2024-11-08 19:25:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2024-11-08 19:25:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 19:25:01,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:01,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 19:25:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 57 states and 94 transitions. [2024-11-08 19:25:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 94 transitions. [2024-11-08 19:25:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 19:25:02,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:25:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 62 states and 104 transitions. [2024-11-08 19:25:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2024-11-08 19:25:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 19:25:04,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 19:25:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 74 states and 132 transitions. [2024-11-08 19:25:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2024-11-08 19:25:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:25:06,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-08 19:25:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 76 states and 134 transitions. [2024-11-08 19:25:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-11-08 19:25:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 19:25:07,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 51 proven. 299 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 19:25:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 86 states and 162 transitions. [2024-11-08 19:25:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 162 transitions. [2024-11-08 19:25:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 19:25:09,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 241 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-08 19:25:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 88 states and 164 transitions. [2024-11-08 19:25:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 164 transitions. [2024-11-08 19:25:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 19:25:09,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 36 proven. 151 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-08 19:25:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 90 states and 166 transitions. [2024-11-08 19:25:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 166 transitions. [2024-11-08 19:25:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 19:25:10,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 116 proven. 121 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-08 19:25:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 92 states and 178 transitions. [2024-11-08 19:25:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 178 transitions. [2024-11-08 19:25:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 19:25:12,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 72 proven. 370 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2024-11-08 19:25:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 102 states and 210 transitions. [2024-11-08 19:25:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 210 transitions. [2024-11-08 19:25:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 19:25:14,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 66 proven. 401 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2024-11-08 19:25:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 104 states and 212 transitions. [2024-11-08 19:25:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 212 transitions. [2024-11-08 19:25:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 19:25:15,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 155 proven. 190 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-08 19:25:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 104 states and 211 transitions. [2024-11-08 19:25:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 211 transitions. [2024-11-08 19:25:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 19:25:16,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 88 proven. 588 refuted. 0 times theorem prover too weak. 2319 trivial. 0 not checked. [2024-11-08 19:25:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 106 states and 213 transitions. [2024-11-08 19:25:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 213 transitions. [2024-11-08 19:25:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-08 19:25:17,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5052 backedges. 586 proven. 701 refuted. 0 times theorem prover too weak. 3765 trivial. 0 not checked. [2024-11-08 19:25:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 106 states and 212 transitions. [2024-11-08 19:25:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 212 transitions. [2024-11-08 19:25:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-11-08 19:25:19,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6848 backedges. 168 proven. 1066 refuted. 0 times theorem prover too weak. 5614 trivial. 0 not checked. [2024-11-08 19:25:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 118 states and 247 transitions. [2024-11-08 19:25:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 247 transitions. [2024-11-08 19:25:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-08 19:25:22,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14700 backedges. 257 proven. 1591 refuted. 0 times theorem prover too weak. 12852 trivial. 0 not checked. [2024-11-08 19:25:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 120 states and 249 transitions. [2024-11-08 19:25:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 249 transitions. [2024-11-08 19:25:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2024-11-08 19:25:24,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12507 backedges. 300 proven. 1486 refuted. 0 times theorem prover too weak. 10721 trivial. 0 not checked. [2024-11-08 19:25:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 123 states and 203 transitions. [2024-11-08 19:25:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 203 transitions. [2024-11-08 19:25:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2024-11-08 19:25:30,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 573 proven. 839 refuted. 0 times theorem prover too weak. 13181 trivial. 0 not checked. [2024-11-08 19:25:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 123 states and 198 transitions. [2024-11-08 19:25:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 198 transitions. [2024-11-08 19:25:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-08 19:25:31,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6469 backedges. 385 proven. 699 refuted. 0 times theorem prover too weak. 5385 trivial. 0 not checked. [2024-11-08 19:25:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 125 states and 196 transitions. [2024-11-08 19:25:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 196 transitions. [2024-11-08 19:25:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-11-08 19:25:33,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 244 proven. 533 refuted. 0 times theorem prover too weak. 4592 trivial. 0 not checked. [2024-11-08 19:25:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 125 states and 195 transitions. [2024-11-08 19:25:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2024-11-08 19:25:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-11-08 19:25:34,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5352 backedges. 393 proven. 387 refuted. 0 times theorem prover too weak. 4572 trivial. 0 not checked. [2024-11-08 19:25:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 125 states and 194 transitions. [2024-11-08 19:25:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 194 transitions. [2024-11-08 19:25:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-08 19:25:35,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:35,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 547 proven. 151 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2024-11-08 19:25:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 125 states and 193 transitions. [2024-11-08 19:25:36,788 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-11-08 19:25:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2024-11-08 19:25:36,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11857 backedges. 874 proven. 630 refuted. 0 times theorem prover too weak. 10353 trivial. 0 not checked. [2024-11-08 19:25:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 125 states and 191 transitions. [2024-11-08 19:25:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2024-11-08 19:25:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-08 19:25:38,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:38,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:38,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:25:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:39,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:25:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:39,550 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 30 iterations. [2024-11-08 19:25:39,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:25:39 ImpRootNode [2024-11-08 19:25:39,712 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:25:39,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:25:39,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:25:39,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:25:39,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:54" (3/4) ... [2024-11-08 19:25:39,716 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:25:39,889 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:25:39,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:25:39,893 INFO L158 Benchmark]: Toolchain (without parser) took 45946.44ms. Allocated memory was 132.1MB in the beginning and 645.9MB in the end (delta: 513.8MB). Free memory was 90.2MB in the beginning and 453.8MB in the end (delta: -363.6MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,893 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 132.1MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 119.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.42ms. Allocated memory is still 132.1MB. Free memory was 90.2MB in the beginning and 78.0MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.47ms. Allocated memory is still 132.1MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,894 INFO L158 Benchmark]: Boogie Preprocessor took 22.30ms. Allocated memory is still 132.1MB. Free memory was 76.4MB in the beginning and 75.5MB in the end (delta: 910.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,894 INFO L158 Benchmark]: RCFGBuilder took 434.63ms. Allocated memory is still 132.1MB. Free memory was 75.5MB in the beginning and 64.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,895 INFO L158 Benchmark]: CodeCheck took 45005.56ms. Allocated memory was 132.1MB in the beginning and 645.9MB in the end (delta: 513.8MB). Free memory was 64.2MB in the beginning and 463.2MB in the end (delta: -399.0MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,895 INFO L158 Benchmark]: Witness Printer took 179.05ms. Allocated memory is still 645.9MB. Free memory was 463.2MB in the beginning and 453.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 19:25:39,897 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 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.8s, OverallIterations: 30, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5505 SdHoareTripleChecker+Valid, 43.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3445 mSDsluCounter, 6248 SdHoareTripleChecker+Invalid, 37.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4004 mSDsCounter, 7028 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24660 IncrementalHoareTripleChecker+Invalid, 31688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7028 mSolverCounterUnsat, 2244 mSDtfsCounter, 24660 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34326 GetRequests, 33130 SyntacticMatches, 848 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62407 ImplicationChecksByTransitivity, 27.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 7861 NumberOfCodeBlocks, 7861 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 7373 ConstructedInterpolants, 0 QuantifiedInterpolants, 9553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 86848/97480 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [x=8] [L41] reach_error() VAL [x=8] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 132.1MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 119.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.42ms. Allocated memory is still 132.1MB. Free memory was 90.2MB in the beginning and 78.0MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.47ms. Allocated memory is still 132.1MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.30ms. Allocated memory is still 132.1MB. Free memory was 76.4MB in the beginning and 75.5MB in the end (delta: 910.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.63ms. Allocated memory is still 132.1MB. Free memory was 75.5MB in the beginning and 64.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 45005.56ms. Allocated memory was 132.1MB in the beginning and 645.9MB in the end (delta: 513.8MB). Free memory was 64.2MB in the beginning and 463.2MB in the end (delta: -399.0MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. * Witness Printer took 179.05ms. Allocated memory is still 645.9MB. Free memory was 463.2MB in the beginning and 453.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 19:25:39,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75129e07-f757-4815-a7ee-e53191dc874c/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