./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3 --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 b72fdbcf4106a2c9e0e7bb38e5b48a5a42fbfd030e4e4dc43ee6290ba06c6869 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:20:23,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:20:23,305 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-25 04:20:23,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:20:23,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:20:23,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:20:23,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:20:23,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:20:23,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:20:23,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:20:23,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:20:23,361 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-25 04:20:23,361 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-25 04:20:23,361 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-25 04:20:23,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:20:23,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 04:20:23,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:20:23,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:20:23,362 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:20:23,362 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:20:23,362 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:20:23,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:20:23,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:20:23,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:20:23,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:20:23,365 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:20:23,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:20:23,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3 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 -> b72fdbcf4106a2c9e0e7bb38e5b48a5a42fbfd030e4e4dc43ee6290ba06c6869 [2024-11-25 04:20:23,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:20:23,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:20:23,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:20:23,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:20:23,735 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:20:23,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i [2024-11-25 04:20:26,690 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/data/baeed71c7/db37579a66964f9ab5785536dbc7d41d/FLAG452e0fc9c [2024-11-25 04:20:27,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:20:27,098 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i [2024-11-25 04:20:27,115 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/data/baeed71c7/db37579a66964f9ab5785536dbc7d41d/FLAG452e0fc9c [2024-11-25 04:20:27,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/data/baeed71c7/db37579a66964f9ab5785536dbc7d41d [2024-11-25 04:20:27,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:20:27,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:20:27,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:20:27,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:20:27,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:20:27,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367aeb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27, skipping insertion in model container [2024-11-25 04:20:27,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:20:27,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:20:27,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:20:27,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:20:27,558 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:20:27,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27 WrapperNode [2024-11-25 04:20:27,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:20:27,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:20:27,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:20:27,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:20:27,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,593 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-11-25 04:20:27,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:20:27,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:20:27,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:20:27,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:20:27,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:20:27,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:20:27,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:20:27,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:20:27,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:20:27" (1/1) ... [2024-11-25 04:20:27,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:20:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:20:27,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:20:27,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:20:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-25 04:20:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-25 04:20:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-25 04:20:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 04:20:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:20:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:20:27,798 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:20:27,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:20:28,116 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-25 04:20:28,116 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:20:28,172 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:20:28,172 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-25 04:20:28,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:20:28 BoogieIcfgContainer [2024-11-25 04:20:28,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:20:28,173 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:20:28,173 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:20:28,189 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:20:28,189 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:20:28" (1/1) ... [2024-11-25 04:20:28,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:20:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 44 states and 47 transitions. [2024-11-25 04:20:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-25 04:20:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 04:20:28,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:28,588 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-25 04:20:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 43 states and 46 transitions. [2024-11-25 04:20:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-25 04:20:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 04:20:28,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:28,838 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-25 04:20:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-25 04:20:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-25 04:20:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 04:20:28,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:29,053 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-25 04:20:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2024-11-25 04:20:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-25 04:20:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 04:20:29,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:29,353 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-25 04:20:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 40 states and 43 transitions. [2024-11-25 04:20:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-25 04:20:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 04:20:29,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:29,711 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-25 04:20:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-25 04:20:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-25 04:20:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 04:20:29,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:29,993 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-25 04:20:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 38 states and 41 transitions. [2024-11-25 04:20:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-25 04:20:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 04:20:30,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:30,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:30,419 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-25 04:20:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-25 04:20:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-25 04:20:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 04:20:30,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:20:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 40 states and 43 transitions. [2024-11-25 04:20:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-25 04:20:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 04:20:30,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:30,532 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-25 04:20:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-25 04:20:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-25 04:20:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 04:20:30,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:30,808 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-25 04:20:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 38 states and 41 transitions. [2024-11-25 04:20:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-25 04:20:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 04:20:30,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:30,982 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-25 04:20:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 37 states and 40 transitions. [2024-11-25 04:20:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-25 04:20:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 04:20:31,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:31,057 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-25 04:20:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 39 states and 43 transitions. [2024-11-25 04:20:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-25 04:20:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:20:31,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:31,306 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-25 04:20:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 41 states and 45 transitions. [2024-11-25 04:20:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-25 04:20:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:20:32,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,051 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-25 04:20:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 40 states and 44 transitions. [2024-11-25 04:20:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-25 04:20:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:20:32,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,158 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-25 04:20:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 42 states and 47 transitions. [2024-11-25 04:20:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-25 04:20:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:20:32,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,226 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-25 04:20:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 43 states and 49 transitions. [2024-11-25 04:20:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-25 04:20:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:20:32,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,318 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-25 04:20:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 44 states and 50 transitions. [2024-11-25 04:20:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-25 04:20:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:20:32,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,398 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-25 04:20:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 46 states and 54 transitions. [2024-11-25 04:20:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-25 04:20:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:20:32,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,491 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-25 04:20:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 48 states and 59 transitions. [2024-11-25 04:20:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-25 04:20:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 04:20:32,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,589 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-25 04:20:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 49 states and 60 transitions. [2024-11-25 04:20:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-25 04:20:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:20:32,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,825 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-25 04:20:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 46 states and 55 transitions. [2024-11-25 04:20:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-25 04:20:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:20:32,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,902 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-25 04:20:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 47 states and 55 transitions. [2024-11-25 04:20:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-25 04:20:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:20:32,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:32,962 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-25 04:20:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 46 states and 54 transitions. [2024-11-25 04:20:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-25 04:20:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:20:32,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:32,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:33,033 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-25 04:20:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 47 states and 55 transitions. [2024-11-25 04:20:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-25 04:20:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:20:33,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:33,204 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-25 04:20:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 52 states and 63 transitions. [2024-11-25 04:20:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2024-11-25 04:20:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:20:33,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:33,502 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-25 04:20:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 53 states and 65 transitions. [2024-11-25 04:20:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2024-11-25 04:20:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:20:33,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:33,743 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-25 04:20:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 54 states and 66 transitions. [2024-11-25 04:20:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-11-25 04:20:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:20:33,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:34,133 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-25 04:20:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 56 states and 68 transitions. [2024-11-25 04:20:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-11-25 04:20:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:20:34,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:34,202 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-25 04:20:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 55 states and 67 transitions. [2024-11-25 04:20:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2024-11-25 04:20:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:20:34,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:34,315 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-25 04:20:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 34 states and 40 transitions. [2024-11-25 04:20:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-25 04:20:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:20:34,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 04:20:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 32 states and 37 transitions. [2024-11-25 04:20:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-25 04:20:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:20:34,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 04:20:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 30 states and 35 transitions. [2024-11-25 04:20:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-25 04:20:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 04:20:34,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:20:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:20:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:20:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 04:20:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:20:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 20 states and 22 transitions. [2024-11-25 04:20:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-25 04:20:35,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 04:20:35,005 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 34 iterations. [2024-11-25 04:20:35,013 INFO L726 CodeCheckObserver]: All specifications hold 25 specifications checked. All of them hold [2024-11-25 04:20:35,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,417 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,417 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,420 INFO L77 FloydHoareUtils]: At program point L556-1(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,420 INFO L77 FloydHoareUtils]: At program point L556-3(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,421 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 561 563) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 04:20:35,421 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,421 INFO L77 FloydHoareUtils]: At program point L556-4(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,421 INFO L77 FloydHoareUtils]: At program point L556-5(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,421 INFO L77 FloydHoareUtils]: At program point L556-8(lines 556 558) the Hoare annotation is: (let ((.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse4 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) .cse0 .cse1 (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse2 (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse3 .cse4) (and (not |ULTIMATE.start_test_fun_#t~short10#1|) .cse0 .cse1 .cse2 .cse3 .cse4))) [2024-11-25 04:20:35,421 INFO L77 FloydHoareUtils]: At program point L556-9(lines 556 558) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,422 INFO L77 FloydHoareUtils]: At program point L556-11(lines 556 558) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,422 INFO L77 FloydHoareUtils]: At program point L556-12(lines 556 558) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,426 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,426 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,426 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,426 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,426 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK(lines 561 563) no Hoare annotation was computed. [2024-11-25 04:20:35,427 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,427 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,427 INFO L77 FloydHoareUtils]: At program point L553(lines 553 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,427 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 560) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 04:20:35,427 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 04:20:35,427 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,427 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,427 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,427 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,428 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 04:20:35,428 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 04:20:35,428 INFO L77 FloydHoareUtils]: At program point L551(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,428 INFO L77 FloydHoareUtils]: At program point L551-1(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 04:20:35,440 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 04:20:35,441 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 04:20:35,442 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 04:20:35,446 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 04:20:35,446 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-25 04:20:35,446 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 04:20:35,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 04:20:35,448 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 04:20:35,448 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 04:20:35,449 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 04:20:35,449 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 04:20:35,450 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 04:20:35,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:20:35 ImpRootNode [2024-11-25 04:20:35,451 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:20:35,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:20:35,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:20:35,453 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:20:35,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:20:28" (3/4) ... [2024-11-25 04:20:35,456 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 04:20:35,464 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-25 04:20:35,464 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 04:20:35,464 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-25 04:20:35,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 04:20:35,554 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:20:35,554 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:20:35,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:20:35,555 INFO L158 Benchmark]: Toolchain (without parser) took 8410.13ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 92.2MB in the beginning and 191.5MB in the end (delta: -99.3MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. [2024-11-25 04:20:35,556 INFO L158 Benchmark]: CDTParser took 1.33ms. Allocated memory is still 167.8MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:20:35,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.81ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:20:35,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.56ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 74.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:20:35,558 INFO L158 Benchmark]: Boogie Preprocessor took 26.07ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:20:35,559 INFO L158 Benchmark]: RCFGBuilder took 552.37ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 55.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:20:35,559 INFO L158 Benchmark]: CodeCheck took 7277.90ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.6MB in the beginning and 198.3MB in the end (delta: -142.7MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2024-11-25 04:20:35,561 INFO L158 Benchmark]: Witness Printer took 103.04ms. Allocated memory is still 352.3MB. Free memory was 198.3MB in the beginning and 191.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:20:35,563 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, 44 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 34, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2496 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2279 mSDsluCounter, 2107 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1531 mSDsCounter, 1165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5219 IncrementalHoareTripleChecker+Invalid, 6384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1165 mSolverCounterUnsat, 576 mSDtfsCounter, 5219 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2385 GetRequests, 2205 SyntacticMatches, 94 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 2048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 6/6 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, ConComCheckerStatistics: 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: 561]: 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 1.33ms. Allocated memory is still 167.8MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.81ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.56ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 74.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.07ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 552.37ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 55.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 7277.90ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.6MB in the beginning and 198.3MB in the end (delta: -142.7MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. * Witness Printer took 103.04ms. Allocated memory is still 352.3MB. Free memory was 198.3MB in the beginning and 191.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - 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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - 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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - 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 - 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-25 04:20:35,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc86bc4-016e-44a2-9c68-907750c4c9d8/bin/ukojak-verify-ENZ3QT5qd3/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