./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_20x0-1.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_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/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_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/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_9cde2701-4d59-49ba-bb99-1d4bb67959ed/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 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:56:27,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:56:27,139 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:56:27,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:56:27,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:56:27,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:56:27,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:56:27,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:56:27,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:56:27,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:56:27,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:56:27,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:56:27,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:56:27,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:56:27,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:56:27,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:56:27,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:56:27,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:56:27,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:56:27,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:56:27,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:56:27,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:56:27,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:56:27,200 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:56:27,201 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:56:27,201 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:56:27,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:56:27,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:56:27,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:56:27,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:56:27,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:56:27,203 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:56:27,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:56:27,203 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_9cde2701-4d59-49ba-bb99-1d4bb67959ed/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_9cde2701-4d59-49ba-bb99-1d4bb67959ed/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 -> 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 [2024-11-09 00:56:27,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:56:27,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:56:27,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:56:27,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:56:27,533 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:56:27,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c Unable to find full path for "g++" [2024-11-09 00:56:29,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:56:29,671 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:56:29,671 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2024-11-09 00:56:29,678 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/data/7e5b174f3/f871ff46da43496c87b49c0ca5f751e1/FLAG519bad29a [2024-11-09 00:56:29,693 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/data/7e5b174f3/f871ff46da43496c87b49c0ca5f751e1 [2024-11-09 00:56:29,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:56:29,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:56:29,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:56:29,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:56:29,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:56:29,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:29,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c422f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29, skipping insertion in model container [2024-11-09 00:56:29,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:29,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:56:29,958 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_9cde2701-4d59-49ba-bb99-1d4bb67959ed/sv-benchmarks/c/recursive-simple/sum_20x0-1.c[481,494] [2024-11-09 00:56:29,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:56:29,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:56:29,983 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_9cde2701-4d59-49ba-bb99-1d4bb67959ed/sv-benchmarks/c/recursive-simple/sum_20x0-1.c[481,494] [2024-11-09 00:56:29,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:56:29,997 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:56:29,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29 WrapperNode [2024-11-09 00:56:29,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:56:29,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:56:29,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:56:29,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:56:30,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,031 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-09 00:56:30,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:56:30,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:56:30,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:56:30,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:56:30,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:56:30,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:56:30,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:56:30,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:56:30,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:56:29" (1/1) ... [2024-11-09 00:56:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:56:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:56:30,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:56:30,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:56:30,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:56:30,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:56:30,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:56:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-09 00:56:30,115 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-09 00:56:30,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:56:30,194 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:56:30,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:56:30,356 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:56:30,356 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:56:30,399 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:56:30,402 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 00:56:30,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:30 BoogieIcfgContainer [2024-11-09 00:56:30,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:56:30,404 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:56:30,404 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:56:30,415 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:56:30,416 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:30" (1/1) ... [2024-11-09 00:56:30,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:56:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2024-11-09 00:56:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-09 00:56:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:56:30,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:30,768 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-09 00:56:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 16 states and 18 transitions. [2024-11-09 00:56:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-09 00:56:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:56:30,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:56:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 23 transitions. [2024-11-09 00:56:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-09 00:56:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:56:31,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 00:56:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 22 states and 29 transitions. [2024-11-09 00:56:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-11-09 00:56:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:56:31,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 00:56:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 25 states and 36 transitions. [2024-11-09 00:56:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2024-11-09 00:56:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:56:31,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 00:56:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 28 states and 44 transitions. [2024-11-09 00:56:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2024-11-09 00:56:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:56:32,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 00:56:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 31 states and 53 transitions. [2024-11-09 00:56:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 53 transitions. [2024-11-09 00:56:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 00:56:32,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 00:56:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 34 states and 63 transitions. [2024-11-09 00:56:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 63 transitions. [2024-11-09 00:56:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 00:56:33,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-09 00:56:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 37 states and 74 transitions. [2024-11-09 00:56:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 74 transitions. [2024-11-09 00:56:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 00:56:33,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:56:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 40 states and 86 transitions. [2024-11-09 00:56:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 86 transitions. [2024-11-09 00:56:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:56:34,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 00:56:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 43 states and 99 transitions. [2024-11-09 00:56:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 99 transitions. [2024-11-09 00:56:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 00:56:34,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-09 00:56:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 46 states and 113 transitions. [2024-11-09 00:56:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2024-11-09 00:56:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:56:35,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 00:56:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 49 states and 128 transitions. [2024-11-09 00:56:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 128 transitions. [2024-11-09 00:56:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 00:56:35,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:35,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-09 00:56:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 52 states and 144 transitions. [2024-11-09 00:56:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 144 transitions. [2024-11-09 00:56:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 00:56:36,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 00:56:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 55 states and 161 transitions. [2024-11-09 00:56:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 161 transitions. [2024-11-09 00:56:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 00:56:36,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-09 00:56:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 58 states and 179 transitions. [2024-11-09 00:56:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 179 transitions. [2024-11-09 00:56:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:56:37,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-09 00:56:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 61 states and 198 transitions. [2024-11-09 00:56:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 198 transitions. [2024-11-09 00:56:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:56:38,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:38,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-09 00:56:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 64 states and 218 transitions. [2024-11-09 00:56:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 218 transitions. [2024-11-09 00:56:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 00:56:39,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:39,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-09 00:56:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 67 states and 239 transitions. [2024-11-09 00:56:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 239 transitions. [2024-11-09 00:56:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 00:56:39,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-09 00:56:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 70 states and 261 transitions. [2024-11-09 00:56:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 261 transitions. [2024-11-09 00:56:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 00:56:40,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:56:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-09 00:56:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:56:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 73 states and 284 transitions. [2024-11-09 00:56:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 284 transitions. [2024-11-09 00:56:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 00:56:41,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:56:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:56:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:41,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:56:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:41,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:56:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:56:41,918 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2024-11-09 00:56:41,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:56:41 ImpRootNode [2024-11-09 00:56:41,987 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:56:41,988 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:56:41,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:56:41,988 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:56:41,989 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:56:30" (3/4) ... [2024-11-09 00:56:41,989 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:56:42,052 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:56:42,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:56:42,053 INFO L158 Benchmark]: Toolchain (without parser) took 12356.27ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 134.6MB in the beginning and 132.6MB in the end (delta: 2.1MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. [2024-11-09 00:56:42,053 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 119.5MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:56:42,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.35ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 131.6MB in the end (delta: 3.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:56:42,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.56ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 130.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:56:42,055 INFO L158 Benchmark]: Boogie Preprocessor took 15.65ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 129.5MB in the end (delta: 632.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:56:42,055 INFO L158 Benchmark]: RCFGBuilder took 353.94ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 119.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 00:56:42,060 INFO L158 Benchmark]: CodeCheck took 11583.36ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 119.0MB in the beginning and 136.8MB in the end (delta: -17.8MB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. [2024-11-09 00:56:42,060 INFO L158 Benchmark]: Witness Printer took 64.71ms. Allocated memory is still 295.7MB. Free memory was 136.8MB in the beginning and 132.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:56:42,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 21, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1454 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 1897 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1619 mSDsCounter, 822 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8012 IncrementalHoareTripleChecker+Invalid, 8834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 822 mSolverCounterUnsat, 278 mSDtfsCounter, 8012 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20678 GetRequests, 19628 SyntacticMatches, 968 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2298 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1300 ConstructedInterpolants, 0 QuantifiedInterpolants, 3360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 20; [L15] int b = 0; VAL [a=20, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=20, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 119.5MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.35ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 131.6MB in the end (delta: 3.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.56ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 130.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.65ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 129.5MB in the end (delta: 632.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.94ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 119.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 11583.36ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 119.0MB in the beginning and 136.8MB in the end (delta: -17.8MB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. * Witness Printer took 64.71ms. Allocated memory is still 295.7MB. Free memory was 136.8MB in the beginning and 132.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:56:42,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cde2701-4d59-49ba-bb99-1d4bb67959ed/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