./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk --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 64bit --witnessprinter.graph.data.programhash 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:13:51,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:13:51,302 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-09 00:13:51,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:13:51,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:13:51,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:13:51,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:13:51,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:13:51,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:13:51,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:13:51,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:13:51,352 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 00:13:51,353 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 00:13:51,353 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 00:13:51,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:13:51,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:13:51,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:13:51,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:13:51,358 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:13:51,358 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:13:51,362 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:13:51,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:13:51,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:13:51,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:13:51,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:13:51,364 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:13:51,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:13:51,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2024-11-09 00:13:51,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:13:51,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:13:51,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:13:51,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:13:51,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:13:51,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i Unable to find full path for "g++" [2024-11-09 00:13:53,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:13:53,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:13:53,993 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2024-11-09 00:13:54,013 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/data/7347123c1/215b61bd238a415a8a663aa092e9bfc6/FLAGf29244abf [2024-11-09 00:13:54,318 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/data/7347123c1/215b61bd238a415a8a663aa092e9bfc6 [2024-11-09 00:13:54,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:13:54,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:13:54,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:13:54,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:13:54,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:13:54,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a4c274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54, skipping insertion in model container [2024-11-09 00:13:54,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:13:54,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:13:54,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:13:54,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:13:54,850 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:13:54,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54 WrapperNode [2024-11-09 00:13:54,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:13:54,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:13:54,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:13:54,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:13:54,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,906 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-11-09 00:13:54,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:13:54,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:13:54,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:13:54,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:13:54,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:13:54,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:13:54,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:13:54,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:13:54,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:13:54,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:13:54,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:13:54,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:13:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:13:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:13:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:13:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:13:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:13:55,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:13:55,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:13:55,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:13:55,419 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-09 00:13:55,420 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:13:55,480 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:13:55,481 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 00:13:55,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:55 BoogieIcfgContainer [2024-11-09 00:13:55,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:13:55,482 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:13:55,483 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:13:55,494 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:13:55,494 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:13:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-09 00:13:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-09 00:13:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:13:55,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2024-11-09 00:13:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-09 00:13:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:13:55,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:55,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 40 states and 43 transitions. [2024-11-09 00:13:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-09 00:13:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:13:56,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-09 00:13:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-09 00:13:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:13:56,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 38 states and 41 transitions. [2024-11-09 00:13:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-09 00:13:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:13:57,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 37 states and 40 transitions. [2024-11-09 00:13:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 00:13:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:13:57,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:57,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 36 states and 39 transitions. [2024-11-09 00:13:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-09 00:13:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:13:58,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 35 states and 37 transitions. [2024-11-09 00:13:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-11-09 00:13:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:13:58,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 36 states and 39 transitions. [2024-11-09 00:13:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-09 00:13:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:13:59,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 39 states and 45 transitions. [2024-11-09 00:13:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-09 00:13:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:13:59,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 42 states and 51 transitions. [2024-11-09 00:13:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-09 00:13:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:13:59,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 45 states and 59 transitions. [2024-11-09 00:14:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-11-09 00:14:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:14:00,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:00,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 48 states and 67 transitions. [2024-11-09 00:14:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-09 00:14:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:14:01,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:01,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 52 states and 78 transitions. [2024-11-09 00:14:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-11-09 00:14:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:14:04,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 51 states and 76 transitions. [2024-11-09 00:14:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2024-11-09 00:14:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:14:04,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:04,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 52 states and 78 transitions. [2024-11-09 00:14:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-11-09 00:14:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:14:04,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 55 states and 86 transitions. [2024-11-09 00:14:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 86 transitions. [2024-11-09 00:14:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:14:05,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:05,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 59 states and 96 transitions. [2024-11-09 00:14:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 96 transitions. [2024-11-09 00:14:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:14:06,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 58 states and 95 transitions. [2024-11-09 00:14:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 95 transitions. [2024-11-09 00:14:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:14:06,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 60 states and 98 transitions. [2024-11-09 00:14:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 98 transitions. [2024-11-09 00:14:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:14:06,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 61 states and 100 transitions. [2024-11-09 00:14:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 100 transitions. [2024-11-09 00:14:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:14:06,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 64 states and 105 transitions. [2024-11-09 00:14:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2024-11-09 00:14:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:14:06,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 63 states and 104 transitions. [2024-11-09 00:14:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2024-11-09 00:14:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:14:06,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 64 states and 104 transitions. [2024-11-09 00:14:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2024-11-09 00:14:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:14:06,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 63 states and 103 transitions. [2024-11-09 00:14:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 103 transitions. [2024-11-09 00:14:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:14:06,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 64 states and 103 transitions. [2024-11-09 00:14:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 103 transitions. [2024-11-09 00:14:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:14:06,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:14:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 64 states and 102 transitions. [2024-11-09 00:14:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 102 transitions. [2024-11-09 00:14:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:14:06,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:14:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 66 states and 103 transitions. [2024-11-09 00:14:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-11-09 00:14:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:14:06,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:14:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 68 states and 107 transitions. [2024-11-09 00:14:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 107 transitions. [2024-11-09 00:14:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:14:07,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:07,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:14:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 74 states and 116 transitions. [2024-11-09 00:14:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 116 transitions. [2024-11-09 00:14:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:14:07,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:14:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 80 states and 123 transitions. [2024-11-09 00:14:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2024-11-09 00:14:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:14:08,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:14:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 80 states and 122 transitions. [2024-11-09 00:14:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-09 00:14:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:14:08,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:14:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 88 states and 132 transitions. [2024-11-09 00:14:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2024-11-09 00:14:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:14:10,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 00:14:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 90 states and 135 transitions. [2024-11-09 00:14:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 135 transitions. [2024-11-09 00:14:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:14:11,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 00:14:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 92 states and 136 transitions. [2024-11-09 00:14:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-11-09 00:14:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:14:11,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 107 states and 165 transitions. [2024-11-09 00:14:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 165 transitions. [2024-11-09 00:14:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:14:21,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:14:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 107 states and 164 transitions. [2024-11-09 00:14:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 164 transitions. [2024-11-09 00:14:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:14:21,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:14:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 45 states and 64 transitions. [2024-11-09 00:14:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-09 00:14:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:14:22,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 50 states and 76 transitions. [2024-11-09 00:14:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2024-11-09 00:14:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:14:31,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:31,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 53 states and 81 transitions. [2024-11-09 00:14:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-11-09 00:14:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:14:33,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:33,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:14:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 57 states and 87 transitions. [2024-11-09 00:14:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2024-11-09 00:14:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:14:39,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:39,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 00:14:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 59 states and 88 transitions. [2024-11-09 00:14:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-09 00:14:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:14:41,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 59 states and 87 transitions. [2024-11-09 00:14:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-09 00:14:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:14:47,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:15:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 66 states and 99 transitions. [2024-11-09 00:15:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2024-11-09 00:15:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:15:02,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:15:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 31 states and 36 transitions. [2024-11-09 00:15:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-09 00:15:17,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:15:17,460 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 45 iterations. [2024-11-09 00:15:17,468 INFO L729 CodeCheckObserver]: All specifications hold 25 specifications checked. All of them hold [2024-11-09 00:15:23,191 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,191 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,192 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,192 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,192 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,192 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,192 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,193 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |ULTIMATE.start_test_fun_#t~mem9#1| 1) .cse11 .cse12) (and .cse0 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-09 00:15:23,196 INFO L77 FloydHoareUtils]: At program point L556(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:15:23,196 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 564 566) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:15:23,197 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-09 00:15:23,197 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-09 00:15:23,198 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,199 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,199 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,199 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,199 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,199 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,199 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK(lines 564 566) no Hoare annotation was computed. [2024-11-09 00:15:23,200 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (let ((.cse15 (select (select |#memory_int| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) |ULTIMATE.start_test_fun_~j_ref~0#1.offset|))) (let ((.cse10 (<= 1 .cse15)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse9 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and (< 1 |ULTIMATE.start_test_fun_#t~mem7#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= 1 |ULTIMATE.start_test_fun_#t~mem7#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_test_fun_#t~mem7#1| 1) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_test_fun_#t~mem7#1| 0) .cse6 .cse7 .cse8 .cse9 (= .cse15 0) .cse11 .cse12 .cse13 .cse14)))) [2024-11-09 00:15:23,200 INFO L77 FloydHoareUtils]: At program point L557-1(lines 557 559) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|)) (.cse17 (select (select |#memory_int| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) |ULTIMATE.start_test_fun_~j_ref~0#1.offset|))) (let ((.cse11 (<= 1 .cse17)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_#t~mem6#1| .cse16)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse12 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and (< 1 |ULTIMATE.start_test_fun_#t~mem7#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 |ULTIMATE.start_test_fun_#t~mem6#1|) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_test_fun_#t~mem7#1| 1) (<= (+ |ULTIMATE.start_test_fun_#t~mem6#1| 1) (+ |ULTIMATE.start_test_fun_#t~mem7#1| .cse16)) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_test_fun_#t~mem7#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= .cse17 0) .cse12 .cse13 .cse14 .cse15)))) [2024-11-09 00:15:23,201 INFO L77 FloydHoareUtils]: At program point L557-3(lines 557 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse9 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) |ULTIMATE.start_test_fun_~j_ref~0#1.offset|)) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= .cse10 0) .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= .cse10 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|)) .cse7 .cse8 .cse9 .cse11 .cse12 (< 1 .cse10) .cse13 .cse14))) [2024-11-09 00:15:23,201 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-09 00:15:23,202 INFO L77 FloydHoareUtils]: At program point L557-4(lines 557 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|) 1) .cse10 .cse11 .cse12) (and .cse0 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-09 00:15:23,202 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:15:23,202 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,203 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,203 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,203 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,204 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,204 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse9 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) |ULTIMATE.start_test_fun_~j_ref~0#1.offset|)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 .cse5) .cse6 (<= .cse5 0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 .cse12) .cse13 .cse14) (and .cse0 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) .cse1 .cse2 .cse3 .cse4 .cse6 (<= 2 .cse12) .cse7 .cse8 .cse9 .cse10 (< 0 .cse5) .cse11 .cse13 .cse14))) [2024-11-09 00:15:23,204 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse9 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_test_fun_#t~mem8#1| 0) .cse11 (<= 0 |ULTIMATE.start_test_fun_#t~mem8#1|) (<= 1 .cse12) .cse13 .cse14) (and .cse0 .cse1 (< 0 |ULTIMATE.start_test_fun_#t~mem8#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 .cse12) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) [2024-11-09 00:15:23,205 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:15:23,205 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,205 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,206 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,206 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,206 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,206 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:15:23,206 INFO L77 FloydHoareUtils]: At program point L555(lines 555 561) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< |ULTIMATE.start_test_fun_#t~mem5#1| 0) .cse9 .cse10 .cse11 .cse12) (and .cse0 (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) .cse1 (= |ULTIMATE.start_test_fun_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-09 00:15:23,207 INFO L77 FloydHoareUtils]: At program point L555-2(lines 555 561) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 1)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse10 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |ULTIMATE.start_test_fun_~i_ref~0#1.offset|) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (not .cse3) .cse1 .cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 1) .cse4 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2024-11-09 00:15:23,208 INFO L77 FloydHoareUtils]: At program point L555-3(lines 555 561) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-09 00:15:23,221 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:15:23,222 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 00:15:23,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-09 00:15:23,225 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-09 00:15:23,226 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-09 00:15:23,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-09 00:15:23,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-09 00:15:23,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-09 00:15:23,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-09 00:15:23,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 00:15:23,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:15:23,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 00:15:23,229 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 00:15:23,229 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:15:23,229 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:15:23,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:15:23 ImpRootNode [2024-11-09 00:15:23,241 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:15:23,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:15:23,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:15:23,246 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:15:23,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:55" (3/4) ... [2024-11-09 00:15:23,250 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:15:23,260 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 00:15:23,261 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:15:23,262 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:15:23,262 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:15:23,365 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:15:23,365 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:15:23,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:15:23,366 INFO L158 Benchmark]: Toolchain (without parser) took 89043.87ms. Allocated memory was 132.1MB in the beginning and 866.1MB in the end (delta: 734.0MB). Free memory was 89.8MB in the beginning and 437.4MB in the end (delta: -347.6MB). Peak memory consumption was 389.9MB. Max. memory is 16.1GB. [2024-11-09 00:15:23,367 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 132.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:15:23,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.19ms. Allocated memory is still 132.1MB. Free memory was 89.4MB in the beginning and 71.1MB in the end (delta: 18.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:15:23,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.77ms. Allocated memory is still 132.1MB. Free memory was 71.1MB in the beginning and 69.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:15:23,371 INFO L158 Benchmark]: Boogie Preprocessor took 29.85ms. Allocated memory is still 132.1MB. Free memory was 69.5MB in the beginning and 68.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:15:23,371 INFO L158 Benchmark]: RCFGBuilder took 543.66ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 68.2MB in the beginning and 127.0MB in the end (delta: -58.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-09 00:15:23,372 INFO L158 Benchmark]: CodeCheck took 87759.34ms. Allocated memory was 165.7MB in the beginning and 866.1MB in the end (delta: 700.4MB). Free memory was 127.0MB in the beginning and 442.7MB in the end (delta: -315.7MB). Peak memory consumption was 385.8MB. Max. memory is 16.1GB. [2024-11-09 00:15:23,372 INFO L158 Benchmark]: Witness Printer took 123.86ms. Allocated memory is still 866.1MB. Free memory was 442.7MB in the beginning and 437.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:15:23,378 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, 42 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 81.9s, OverallIterations: 45, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6092 SdHoareTripleChecker+Valid, 29.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5730 mSDsluCounter, 2990 SdHoareTripleChecker+Invalid, 25.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2498 mSDsCounter, 2088 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15344 IncrementalHoareTripleChecker+Invalid, 17432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2088 mSolverCounterUnsat, 492 mSDtfsCounter, 15344 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5565 GetRequests, 4852 SyntacticMatches, 195 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143844 ImplicationChecksByTransitivity, 73.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 569 ConstructedInterpolants, 0 QuantifiedInterpolants, 4756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 111/213 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: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 132.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.19ms. Allocated memory is still 132.1MB. Free memory was 89.4MB in the beginning and 71.1MB in the end (delta: 18.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.77ms. Allocated memory is still 132.1MB. Free memory was 71.1MB in the beginning and 69.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.85ms. Allocated memory is still 132.1MB. Free memory was 69.5MB in the beginning and 68.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 543.66ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 68.2MB in the beginning and 127.0MB in the end (delta: -58.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * CodeCheck took 87759.34ms. Allocated memory was 165.7MB in the beginning and 866.1MB in the end (delta: 700.4MB). Free memory was 127.0MB in the beginning and 442.7MB in the end (delta: -315.7MB). Peak memory consumption was 385.8MB. Max. memory is 16.1GB. * Witness Printer took 123.86ms. Allocated memory is still 866.1MB. Free memory was 442.7MB in the beginning and 437.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - 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-09 00:15:23,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b432cfc-eebb-4f9f-8780-a79dff33fd3e/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE