./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/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_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:16:51,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:16:51,145 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-13 21:16:51,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:16:51,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:16:51,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:16:51,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:16:51,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:16:51,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:16:51,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:16:51,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:16:51,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:16:51,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:16:51,190 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 21:16:51,191 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 21:16:51,191 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 21:16:51,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:16:51,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:16:51,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 21:16:51,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:16:51,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:16:51,192 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:16:51,192 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:16:51,192 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:16:51,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:16:51,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:16:51,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:16:51,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:16:51,193 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:16:51,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:16:51,194 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_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 [2024-11-13 21:16:51,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:16:51,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:16:51,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:16:51,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:16:51,545 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:16:51,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i Unable to find full path for "g++" [2024-11-13 21:16:53,482 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:16:53,908 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:16:53,912 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2024-11-13 21:16:53,929 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/data/63d031e9e/f11704d5c67d43f7b60e8ca7ccce3fbb/FLAGe6ce8d93d [2024-11-13 21:16:53,950 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/data/63d031e9e/f11704d5c67d43f7b60e8ca7ccce3fbb [2024-11-13 21:16:53,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:16:53,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:16:53,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:16:53,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:16:53,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:16:53,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:16:53" (1/1) ... [2024-11-13 21:16:53,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e778260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:53, skipping insertion in model container [2024-11-13 21:16:53,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:16:53" (1/1) ... [2024-11-13 21:16:54,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:16:54,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:16:54,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:16:54,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:16:54,369 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:16:54,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54 WrapperNode [2024-11-13 21:16:54,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:16:54,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:16:54,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:16:54,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:16:54,378 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:16:54" (1/1) ... [2024-11-13 21:16:54,389 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:16:54" (1/1) ... [2024-11-13 21:16:54,407 INFO L138 Inliner]: procedures = 125, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-13 21:16:54,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:16:54,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:16:54,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:16:54,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:16:54,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:16:54,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:16:54,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:16:54,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:16:54,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:16:54" (1/1) ... [2024-11-13 21:16:54,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:16:54,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:16:54,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/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:16:54,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/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:16:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:16:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:16:54,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:16:54,654 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:16:54,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:16:55,036 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-13 21:16:55,036 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:16:55,106 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:16:55,106 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 21:16:55,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:16:55 BoogieIcfgContainer [2024-11-13 21:16:55,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:16:55,107 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:16:55,107 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:16:55,122 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:16:55,122 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:16:55" (1/1) ... [2024-11-13 21:16:55,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:16:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-11-13 21:16:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-11-13 21:16:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 21:16:55,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:55,466 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:16:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2024-11-13 21:16:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2024-11-13 21:16:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 21:16:55,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:55,676 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:16:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2024-11-13 21:16:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2024-11-13 21:16:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:16:55,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:55,937 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:16:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-11-13 21:16:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-11-13 21:16:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:16:55,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:56,180 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:16:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2024-11-13 21:16:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2024-11-13 21:16:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:16:56,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:56,252 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:16:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2024-11-13 21:16:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2024-11-13 21:16:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:16:56,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:56,397 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:16:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2024-11-13 21:16:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2024-11-13 21:16:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 21:16:56,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:56,951 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:16:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-11-13 21:16:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-11-13 21:16:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 21:16:57,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:57,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:57,816 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:16:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2024-11-13 21:16:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2024-11-13 21:16:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:16:58,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:58,587 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:16:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-13 21:16:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-13 21:16:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:16:58,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:58,828 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:16:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:16:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2024-11-13 21:16:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2024-11-13 21:16:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:16:59,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:16:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:16:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:16:59,536 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:17:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-11-13 21:17:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-11-13 21:17:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:17:01,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:01,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:02,171 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:17:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2024-11-13 21:17:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2024-11-13 21:17:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:17:04,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:05,198 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:17:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2024-11-13 21:17:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2024-11-13 21:17:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:17:08,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:09,014 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:17:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2024-11-13 21:17:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2024-11-13 21:17:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:17:13,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:13,931 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:17:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2024-11-13 21:17:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2024-11-13 21:17:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:17:14,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:14,499 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:17:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2024-11-13 21:17:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2024-11-13 21:17:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:17:14,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:14,937 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:17:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-11-13 21:17:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-11-13 21:17:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:17:15,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:15,336 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:17:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2024-11-13 21:17:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2024-11-13 21:17:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:17:16,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:16,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:16,035 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:17:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2024-11-13 21:17:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2024-11-13 21:17:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:17:16,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:16,114 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:17:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-11-13 21:17:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-11-13 21:17:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:17:16,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:16,162 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:17:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-13 21:17:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-13 21:17:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:17:16,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:16,523 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:17:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-11-13 21:17:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-11-13 21:17:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:17:17,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:17,328 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:17:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-11-13 21:17:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-11-13 21:17:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:17:17,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:17,559 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:17:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-11-13 21:17:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-11-13 21:17:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:18,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:20,594 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:17:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-13 21:17:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-13 21:17:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:29,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:32,871 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:17:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-11-13 21:17:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-11-13 21:17:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:17:43,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:46,177 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:17:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-13 21:17:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-13 21:17:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:17:55,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:59,715 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:18:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-11-13 21:18:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-11-13 21:18:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:18:16,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:19,929 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:18:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-11-13 21:18:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-11-13 21:18:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 21:18:24,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:24,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:30,627 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:18:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 31 states and 30 transitions. [2024-11-13 21:18:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2024-11-13 21:18:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 21:18:58,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:03,428 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:19:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 30 states and 29 transitions. [2024-11-13 21:19:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2024-11-13 21:19:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:19:37,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:37,410 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:19:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 29 states and 28 transitions. [2024-11-13 21:19:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2024-11-13 21:19:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:19:43,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:48,444 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:19:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 28 states and 27 transitions. [2024-11-13 21:19:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2024-11-13 21:19:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:19:58,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:20:04,945 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:20:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:20:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 27 states and 26 transitions. [2024-11-13 21:20:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2024-11-13 21:20:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:20:50,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:20:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:20:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:20:58,580 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:21:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 26 states and 25 transitions. [2024-11-13 21:21:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2024-11-13 21:21:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:21:19,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:35,479 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:23:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 25 states and 24 transitions. [2024-11-13 21:23:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-11-13 21:23:04,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:23:04,347 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 37 iterations. [2024-11-13 21:23:04,357 INFO L729 CodeCheckObserver]: All specifications hold 35 specifications checked. All of them hold [2024-11-13 21:23:05,011 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,011 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,011 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,011 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,011 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,012 INFO L77 FloydHoareUtils]: At program point L531(line 531) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse0 (select .cse5 |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (.cse4 (select |#length| .cse0)) (.cse1 (select .cse5 4)) (.cse3 (select .cse5 0))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse0) 1) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select .cse2 |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select .cse2 4) 0) (= (store (store (store |#valid| .cse1 0) .cse3 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= .cse4 4) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= (select |#length| (select .cse5 (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| 4))) 4) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse1) 1) (<= 4 .cse4) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1) (not (= .cse1 .cse3)))))) [2024-11-13 21:23:05,012 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,012 INFO L77 FloydHoareUtils]: At program point L531-1(line 531) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse3 (select .cse4 0)) (.cse2 (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| 4)) (.cse0 (select .cse4 4)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| .cse0)) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| .cse3) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem5#1.base|) 1) (<= (+ (select .cse4 |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (store (store (store |#valid| .cse0 0) .cse3 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= (select |#length| (select .cse4 .cse2)) 4) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| (select .cse1 0))))) [2024-11-13 21:23:05,013 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,013 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,013 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 543 548) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 21:23:05,013 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE(line 541) no Hoare annotation was computed. [2024-11-13 21:23:05,013 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE(line 540) no Hoare annotation was computed. [2024-11-13 21:23:05,013 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,013 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,013 INFO L77 FloydHoareUtils]: At program point L540(line 540) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 21:23:05,014 INFO L77 FloydHoareUtils]: At program point L540-1(line 540) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 21:23:05,014 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,014 INFO L77 FloydHoareUtils]: At program point L540-2(line 540) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 21:23:05,014 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,014 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,015 INFO L77 FloydHoareUtils]: At program point L532(line 532) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse2 (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (.cse0 (select .cse4 4)) (.cse3 (select .cse4 0)) (.cse5 (select .cse4 |ULTIMATE.start_main_~#data~0#1.offset|))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (store (store (store |#valid| .cse0 0) .cse3 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select (select |#memory_int| .cse3) (select .cse1 0)) 4) (= (select |#length| (select .cse4 .cse2)) 4) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= 4 (select |#length| .cse5)) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select .cse1 |ULTIMATE.start_main_~#data~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1) (= (select |#valid| .cse5) 1) (not (= .cse0 .cse3)) (<= (+ .cse5 1) |#StackHeapBarrier|)))) [2024-11-13 21:23:05,015 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,016 INFO L77 FloydHoareUtils]: At program point L532-1(line 532) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse2 (select .cse4 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) (.cse0 (select .cse4 |ULTIMATE.start_main_~#data~0#1.offset|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (<= 4 (select |#length| .cse0)) (= (select |#valid| .cse0) 1) (not (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| .cse1)) (<= (+ .cse2 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (= .cse2 |ULTIMATE.start_alloc_data_#t~mem6#1.base|) (= (select (select |#memory_int| .cse1) (select .cse3 0)) 4) (= (select .cse3 |ULTIMATE.start_main_~#data~0#1.offset|) 0) (= (store (store (store |#valid| .cse2 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select .cse3 4) |ULTIMATE.start_alloc_data_#t~mem6#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) 1) (= |ULTIMATE.start_alloc_data_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#length| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) 4)))) [2024-11-13 21:23:05,016 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,016 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE(line 540) no Hoare annotation was computed. [2024-11-13 21:23:05,016 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE(line 541) no Hoare annotation was computed. [2024-11-13 21:23:05,016 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK(lines 543 548) no Hoare annotation was computed. [2024-11-13 21:23:05,016 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:23:05,016 INFO L77 FloydHoareUtils]: At program point L541(line 541) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-11-13 21:23:05,017 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,017 INFO L77 FloydHoareUtils]: At program point L541-1(line 541) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-11-13 21:23:05,017 INFO L77 FloydHoareUtils]: At program point L541-2(line 541) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-11-13 21:23:05,017 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,017 INFO L77 FloydHoareUtils]: At program point L537(line 537) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) .cse2)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) .cse2))) (and (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (= .cse1 0) (<= 4 (select |#length| .cse0)) (<= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (<= (+ .cse0 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= .cse0 |ULTIMATE.start_free_data_~#data#1.base|)) (= (select |#valid| 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_free_data_~lo~0#1.base|) |ULTIMATE.start_free_data_~lo~0#1.offset|) 4) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (= (select (select |#memory_int| .cse0) .cse1) 8) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (select |#valid| .cse0) 1)))) [2024-11-13 21:23:05,018 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,018 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,018 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,018 INFO L77 FloydHoareUtils]: At program point L529(line 529) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 4) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= (store (store |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)) [2024-11-13 21:23:05,018 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE(line 541) no Hoare annotation was computed. [2024-11-13 21:23:05,018 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,019 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:23:05,019 INFO L77 FloydHoareUtils]: At program point L546(line 546) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|)) (.cse0 (select .cse4 |ULTIMATE.start_main_~#data~0#1.offset|)) (.cse1 (select .cse4 .cse3))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#valid| .cse1) 1) (<= 4 (select |#length| .cse0)) (= (select |#valid| .cse0) 1) (= (select .cse2 .cse3) 0) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (= (select (select |#memory_int| (select .cse4 0)) (select .cse2 0)) 4) (= (select (select |#memory_int| (select .cse4 4)) (select .cse2 4)) 8) (= (select .cse2 |ULTIMATE.start_main_~#data~0#1.offset|) 0) (= (store (store (store |#valid| .cse1 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (< .cse1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (<= 4 (select |#length| .cse1))))) [2024-11-13 21:23:05,019 INFO L77 FloydHoareUtils]: At program point L546-1(line 546) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|))) (let ((.cse2 (select .cse4 4)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|)) (.cse3 (select .cse4 .cse1))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (select .cse0 .cse1) 0) (= (select |#valid| .cse2) 1) (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (<= (+ .cse3 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem11#1.base|) |ULTIMATE.start_main_#t~mem11#1.offset|) 4) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)) (= (select (select |#memory_int| .cse2) (select .cse0 4)) 8) (= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1) (<= (+ |ULTIMATE.start_main_#t~mem11#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (store (store (store |#valid| .cse3 0) |ULTIMATE.start_main_#t~mem11#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| .cse3))))) [2024-11-13 21:23:05,019 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,020 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,020 INFO L77 FloydHoareUtils]: At program point L538(line 538) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_free_data_~lo~0#1.base|) |ULTIMATE.start_free_data_~lo~0#1.offset|) 4) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= 8 (select (select |#memory_int| |ULTIMATE.start_free_data_~hi~0#1.base|) |ULTIMATE.start_free_data_~hi~0#1.offset|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 21:23:05,020 INFO L77 FloydHoareUtils]: At program point L538-1(line 538) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= |ULTIMATE.start_free_data_#t~mem9#1| 4) (= 8 (select (select |#memory_int| |ULTIMATE.start_free_data_~hi~0#1.base|) |ULTIMATE.start_free_data_~hi~0#1.offset|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 21:23:05,020 INFO L77 FloydHoareUtils]: At program point L538-2(lines 538 539) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= 8 |ULTIMATE.start_free_data_#t~mem10#1|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (= |ULTIMATE.start_free_data_#t~mem9#1| 4) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 21:23:05,021 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,021 INFO L77 FloydHoareUtils]: At program point L534(lines 534 542) the Hoare annotation is: (let ((.cse0 (+ |#StackHeapBarrier| 1))) (and (<= .cse0 |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|) (<= .cse0 |ULTIMATE.start_free_data_~#data#1.base|) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_#in~data#1.hi.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_#in~data#1.lo.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_free_data_#in~data#1.lo.base|)) (<= (+ |ULTIMATE.start_free_data_#in~data#1.lo.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.lo.base|) 1) (= 4 (select (select |#memory_int| |ULTIMATE.start_free_data_#in~data#1.lo.base|) |ULTIMATE.start_free_data_#in~data#1.lo.offset|)) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (= |ULTIMATE.start_free_data_#in~data#1.lo.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_free_data_#in~data#1.hi.base|) |ULTIMATE.start_free_data_#in~data#1.hi.offset|) 8) (= (select |#valid| 0) 0) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_free_data_#in~data#1.hi.base|)))) [2024-11-13 21:23:05,021 INFO L77 FloydHoareUtils]: At program point L534-1(lines 534 542) the Hoare annotation is: (let ((.cse0 (+ |#StackHeapBarrier| 1)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (and (<= .cse0 |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|) (<= .cse0 |ULTIMATE.start_free_data_~#data#1.base|) (= (select (select |#memory_int| .cse1) .cse2) 4) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (<= 4 (select |#length| .cse1)) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0) (= .cse2 0) (= (select |#valid| .cse1) 1) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_free_data_#in~data#1.hi.base|) |ULTIMATE.start_free_data_#in~data#1.hi.offset|) 8) (= (select |#valid| 0) 0) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_#in~data#1.hi.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) .cse1 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-13 21:23:05,022 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,022 INFO L77 FloydHoareUtils]: At program point L534-2(lines 534 542) the Hoare annotation is: (let ((.cse6 (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|)) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|))) (let ((.cse0 (+ |#StackHeapBarrier| 1)) (.cse2 (select .cse7 |ULTIMATE.start_free_data_~#data#1.offset|)) (.cse1 (select .cse5 |ULTIMATE.start_free_data_~#data#1.offset|)) (.cse3 (select .cse7 .cse6)) (.cse4 (select .cse5 .cse6))) (and (<= .cse0 |ULTIMATE.start_main_~#data~0#1.base|) (<= .cse0 |ULTIMATE.start_free_data_~#data#1.base|) (= (select (select |#memory_int| .cse1) .cse2) 4) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (<= 4 (select |#length| .cse1)) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (= .cse3 0) (<= 4 (select |#length| .cse4)) (<= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= (+ .cse4 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) .cse4 0) |ULTIMATE.start_main_~#data~0#1.base| 0) .cse1 0)) (= .cse2 0) (= (select |#valid| .cse1) 1) (= (select |#valid| 0) 0) (= (select (select |#memory_int| .cse4) .cse3) 8) (= (select |#valid| .cse4) 1)))) [2024-11-13 21:23:05,022 INFO L77 FloydHoareUtils]: At program point L534-3(lines 534 542) the Hoare annotation is: (= (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) [2024-11-13 21:23:05,022 INFO L77 FloydHoareUtils]: At program point L530(line 530) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (.cse1 (select .cse2 0))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse0) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= 4 (select |#length| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#length| .cse1) 4) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store (store |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 0) .cse1 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse1 |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) 1) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)))) [2024-11-13 21:23:05,023 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,023 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,023 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:23:05,023 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE(line 540) no Hoare annotation was computed. [2024-11-13 21:23:05,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:23:05,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:23:05,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:23:05,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:23:05,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:23:05 ImpRootNode [2024-11-13 21:23:05,034 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:23:05,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:23:05,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:23:05,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:23:05,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:16:55" (3/4) ... [2024-11-13 21:23:05,038 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:23:05,045 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-13 21:23:05,045 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-13 21:23:05,045 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 21:23:05,045 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:23:05,118 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:23:05,118 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:23:05,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:23:05,120 INFO L158 Benchmark]: Toolchain (without parser) took 371163.75ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 117.4MB in the beginning and 726.4MB in the end (delta: -609.0MB). Peak memory consumption was 729.0MB. Max. memory is 16.1GB. [2024-11-13 21:23:05,120 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 167.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:23:05,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.84ms. Allocated memory is still 142.6MB. Free memory was 117.1MB in the beginning and 100.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:23:05,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.04ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:23:05,122 INFO L158 Benchmark]: Boogie Preprocessor took 29.87ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:23:05,123 INFO L158 Benchmark]: RCFGBuilder took 667.66ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 77.2MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:23:05,124 INFO L158 Benchmark]: CodeCheck took 369927.03ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 77.2MB in the beginning and 734.8MB in the end (delta: -657.6MB). Peak memory consumption was 678.7MB. Max. memory is 16.1GB. [2024-11-13 21:23:05,124 INFO L158 Benchmark]: Witness Printer took 83.67ms. Allocated memory is still 1.5GB. Free memory was 734.8MB in the beginning and 726.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:23:05,126 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 1 procedures, 60 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 369.2s, OverallIterations: 37, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1425 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1302 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 23.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 3542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12267 IncrementalHoareTripleChecker+Invalid, 15809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3542 mSolverCounterUnsat, 53 mSDtfsCounter, 12267 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3487 GetRequests, 2442 SyntacticMatches, 51 SemanticMatches, 994 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455604 ImplicationChecksByTransitivity, 355.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 67.5s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 5332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 543]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 167.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.84ms. Allocated memory is still 142.6MB. Free memory was 117.1MB in the beginning and 100.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.04ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.87ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 667.66ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 77.2MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 369927.03ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 77.2MB in the beginning and 734.8MB in the end (delta: -657.6MB). Peak memory consumption was 678.7MB. Max. memory is 16.1GB. * Witness Printer took 83.67ms. Allocated memory is still 1.5GB. Free memory was 734.8MB in the beginning and 726.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid RESULT: Ultimate proved your program to be correct! [2024-11-13 21:23:05,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff53eb9b-9e3e-4d42-bfdd-fa61c6d123ad/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 Result: TRUE