./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/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_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm --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.3.0-dev-826ab2b [2024-11-13 21:03:10,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:03:10,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:03:10,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:03:10,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:03:10,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:03:10,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:03:10,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:03:10,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:03:10,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:03:10,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:03:10,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:03:10,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:03:10,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:03:10,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:03:10,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:03:10,487 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:03:10,487 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:03:10,487 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:03:10,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:03:10,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:03:10,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:03:10,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:03:10,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:03:10,488 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:03:10,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:03:10,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm 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-13 21:03:10,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:03:10,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:03:10,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:03:10,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:03:10,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:03:10,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c Unable to find full path for "g++" [2024-11-13 21:03:12,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:03:13,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:03:13,255 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2024-11-13 21:03:13,262 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/data/763a5babb/abeeb1fa136645d785067bc8210deaf4/FLAG31fb343d9 [2024-11-13 21:03:13,279 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/data/763a5babb/abeeb1fa136645d785067bc8210deaf4 [2024-11-13 21:03:13,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:03:13,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:03:13,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:03:13,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:03:13,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:03:13,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2824bccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13, skipping insertion in model container [2024-11-13 21:03:13,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:03:13,472 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_6144b5d7-8c99-45e1-a379-9b08691214b5/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2024-11-13 21:03:13,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:03:13,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:03:13,506 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_6144b5d7-8c99-45e1-a379-9b08691214b5/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2024-11-13 21:03:13,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:03:13,524 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:03:13,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13 WrapperNode [2024-11-13 21:03:13,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:03:13,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:03:13,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:03:13,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:03:13,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,562 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-13 21:03:13,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:03:13,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:03:13,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:03:13,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:03:13,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:03:13,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:03:13,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:03:13,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:03:13,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:03:13,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:03:13,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:03:13,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:03:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:03:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:03:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-13 21:03:13,666 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-13 21:03:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-13 21:03:13,667 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-13 21:03:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:03:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:03:13,760 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:03:13,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:03:13,939 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 21:03:13,939 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:03:13,964 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:03:13,964 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 21:03:13,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:03:13 BoogieIcfgContainer [2024-11-13 21:03:13,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:03:13,965 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:03:13,965 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:03:13,979 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:03:13,979 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:03:13" (1/1) ... [2024-11-13 21:03:13,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:03:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2024-11-13 21:03:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-13 21:03:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:03:14,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:14,464 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-13 21:03:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2024-11-13 21:03:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-13 21:03:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:03:14,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:14,763 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-13 21:03:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2024-11-13 21:03:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-11-13 21:03:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:03:15,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:15,485 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-13 21:03:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2024-11-13 21:03:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-11-13 21:03:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:03:15,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:16,084 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-13 21:03:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2024-11-13 21:03:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2024-11-13 21:03:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:03:17,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:17,380 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-13 21:03:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2024-11-13 21:03:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-11-13 21:03:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:03:17,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:18,473 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-13 21:03:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 45 states and 66 transitions. [2024-11-13 21:03:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-11-13 21:03:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:03:19,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:19,692 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-13 21:03:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 57 states and 95 transitions. [2024-11-13 21:03:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2024-11-13 21:03:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 21:03:21,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:21,741 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-13 21:03:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 57 states and 94 transitions. [2024-11-13 21:03:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 94 transitions. [2024-11-13 21:03:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-13 21:03:22,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:22,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:22,768 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-13 21:03:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 62 states and 104 transitions. [2024-11-13 21:03:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2024-11-13 21:03:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:03:25,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:25,388 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-13 21:03:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 72 states and 130 transitions. [2024-11-13 21:03:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 130 transitions. [2024-11-13 21:03:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 21:03:27,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:27,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 98 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-13 21:03:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 74 states and 132 transitions. [2024-11-13 21:03:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2024-11-13 21:03:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 21:03:27,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 54 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-13 21:03:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 76 states and 134 transitions. [2024-11-13 21:03:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-11-13 21:03:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 21:03:28,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 59 proven. 341 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-11-13 21:03:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 86 states and 162 transitions. [2024-11-13 21:03:30,982 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 162 transitions. [2024-11-13 21:03:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 21:03:30,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:31,289 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-13 21:03:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 88 states and 164 transitions. [2024-11-13 21:03:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 164 transitions. [2024-11-13 21:03:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 21:03:31,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:31,990 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-13 21:03:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 90 states and 166 transitions. [2024-11-13 21:03:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 166 transitions. [2024-11-13 21:03:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 21:03:32,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:33,161 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-13 21:03:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 94 states and 180 transitions. [2024-11-13 21:03:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 180 transitions. [2024-11-13 21:03:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-13 21:03:34,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:34,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 186 proven. 229 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-11-13 21:03:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 94 states and 179 transitions. [2024-11-13 21:03:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 179 transitions. [2024-11-13 21:03:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 21:03:36,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 54 proven. 348 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-11-13 21:03:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 106 states and 212 transitions. [2024-11-13 21:03:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 212 transitions. [2024-11-13 21:03:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 21:03:39,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 71 proven. 461 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2024-11-13 21:03:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 108 states and 214 transitions. [2024-11-13 21:03:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 214 transitions. [2024-11-13 21:03:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2024-11-13 21:03:40,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18304 backedges. 262 proven. 1830 refuted. 0 times theorem prover too weak. 16212 trivial. 0 not checked. [2024-11-13 21:03:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 118 states and 248 transitions. [2024-11-13 21:03:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 248 transitions. [2024-11-13 21:03:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-11-13 21:03:45,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7277 backedges. 208 proven. 1069 refuted. 0 times theorem prover too weak. 6000 trivial. 0 not checked. [2024-11-13 21:03:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 120 states and 250 transitions. [2024-11-13 21:03:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 250 transitions. [2024-11-13 21:03:46,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2024-11-13 21:03:46,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 236 proven. 1616 refuted. 0 times theorem prover too weak. 12741 trivial. 0 not checked. [2024-11-13 21:03:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 122 states and 252 transitions. [2024-11-13 21:03:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 252 transitions. [2024-11-13 21:03:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-11-13 21:03:48,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:48,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 624 proven. 517 refuted. 0 times theorem prover too weak. 3875 trivial. 0 not checked. [2024-11-13 21:03:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 124 states and 253 transitions. [2024-11-13 21:03:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 253 transitions. [2024-11-13 21:03:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2024-11-13 21:03:50,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 19507 backedges. 398 proven. 1558 refuted. 0 times theorem prover too weak. 17551 trivial. 0 not checked. [2024-11-13 21:03:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 123 states and 202 transitions. [2024-11-13 21:03:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 202 transitions. [2024-11-13 21:03:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-13 21:03:56,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:56,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:03:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9021 backedges. 333 proven. 1166 refuted. 0 times theorem prover too weak. 7522 trivial. 0 not checked. [2024-11-13 21:03:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:03:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 125 states and 198 transitions. [2024-11-13 21:03:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 198 transitions. [2024-11-13 21:03:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2024-11-13 21:03:59,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:03:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:03:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18304 backedges. 465 proven. 1423 refuted. 0 times theorem prover too weak. 16416 trivial. 0 not checked. [2024-11-13 21:04:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 127 states and 196 transitions. [2024-11-13 21:04:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 196 transitions. [2024-11-13 21:04:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2024-11-13 21:04:01,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:02,687 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-13 21:04:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 127 states and 191 transitions. [2024-11-13 21:04:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2024-11-13 21:04:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-11-13 21:04:03,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 849 proven. 481 refuted. 0 times theorem prover too weak. 8083 trivial. 0 not checked. [2024-11-13 21:04:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 127 states and 189 transitions. [2024-11-13 21:04:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2024-11-13 21:04:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-13 21:04:05,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:05,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4062 backedges. 524 proven. 149 refuted. 0 times theorem prover too weak. 3389 trivial. 0 not checked. [2024-11-13 21:04:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 127 states and 188 transitions. [2024-11-13 21:04:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2024-11-13 21:04:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-13 21:04:06,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:04:06,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:04:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:04:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:04:06,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:04:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:04:06,955 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 30 iterations. [2024-11-13 21:04:07,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:04:07 ImpRootNode [2024-11-13 21:04:07,107 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:04:07,108 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:04:07,108 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:04:07,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:04:07,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:03:13" (3/4) ... [2024-11-13 21:04:07,111 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:04:07,218 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:04:07,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:04:07,220 INFO L158 Benchmark]: Toolchain (without parser) took 53936.45ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 117.8MB in the beginning and 255.2MB in the end (delta: -137.4MB). Peak memory consumption was 323.3MB. Max. memory is 16.1GB. [2024-11-13 21:04:07,220 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:04:07,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.94ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 106.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:04:07,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 105.9MB in the end (delta: 938.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:04:07,221 INFO L158 Benchmark]: Boogie Preprocessor took 18.91ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.1MB in the end (delta: 720.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:04:07,222 INFO L158 Benchmark]: RCFGBuilder took 381.44ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.7MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:04:07,222 INFO L158 Benchmark]: CodeCheck took 53142.31ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 94.7MB in the beginning and 262.5MB in the end (delta: -167.7MB). Peak memory consumption was 289.7MB. Max. memory is 16.1GB. [2024-11-13 21:04:07,223 INFO L158 Benchmark]: Witness Printer took 110.35ms. Allocated memory is still 604.0MB. Free memory was 262.5MB in the beginning and 255.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:04:07,225 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: 53.0s, OverallIterations: 30, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5521 SdHoareTripleChecker+Valid, 49.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3461 mSDsluCounter, 6164 SdHoareTripleChecker+Invalid, 41.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3956 mSDsCounter, 6865 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24421 IncrementalHoareTripleChecker+Invalid, 31286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6865 mSolverCounterUnsat, 2208 mSDtfsCounter, 24421 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33793 GetRequests, 32587 SyntacticMatches, 856 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64716 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 8578 NumberOfCodeBlocks, 8578 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 8090 ConstructedInterpolants, 0 QuantifiedInterpolants, 10306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 115761/128564 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.42ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.94ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 106.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 105.9MB in the end (delta: 938.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.91ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.1MB in the end (delta: 720.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.44ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.7MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 53142.31ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 94.7MB in the beginning and 262.5MB in the end (delta: -167.7MB). Peak memory consumption was 289.7MB. Max. memory is 16.1GB. * Witness Printer took 110.35ms. Allocated memory is still 604.0MB. Free memory was 262.5MB in the beginning and 255.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:04:07,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6144b5d7-8c99-45e1-a379-9b08691214b5/bin/ukojak-verify-EEHR8qb7sm/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