./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:19:02,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:19:02,873 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-13 21:19:02,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:19:02,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:19:02,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:19:02,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:19:02,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:19:02,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:19:02,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 21:19:02,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:19:02,918 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:19:02,919 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:19:02,919 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:19:02,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:19:02,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:19:02,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:19:02,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:19:02,919 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:19:02,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:19:02,919 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_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 [2024-11-13 21:19:03,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:19:03,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:19:03,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:19:03,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:19:03,303 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:19:03,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i Unable to find full path for "g++" [2024-11-13 21:19:05,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:19:05,558 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:19:05,562 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2024-11-13 21:19:05,580 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/data/76fe4660b/cd524a68c01041fb917b853abf962a74/FLAG83748cda7 [2024-11-13 21:19:05,596 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/data/76fe4660b/cd524a68c01041fb917b853abf962a74 [2024-11-13 21:19:05,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:19:05,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:19:05,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:19:05,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:19:05,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:19:05,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:05,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a33a93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05, skipping insertion in model container [2024-11-13 21:19:05,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:05,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:19:05,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:19:05,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:19:05,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:19:05,999 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:19:05,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05 WrapperNode [2024-11-13 21:19:06,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:19:06,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:19:06,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:19:06,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:19:06,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,036 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-11-13 21:19:06,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:19:06,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:19:06,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:19:06,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:19:06,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:19:06,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:19:06,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:19:06,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:19:06,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:19:05" (1/1) ... [2024-11-13 21:19:06,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:19:06,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:19:06,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:19:06,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:19:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 21:19:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 21:19:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 21:19:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 21:19:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:19:06,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:19:06,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:19:06,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:19:06,483 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-13 21:19:06,483 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:19:06,573 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:19:06,573 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:19:06,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:19:06 BoogieIcfgContainer [2024-11-13 21:19:06,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:19:06,576 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:19:06,576 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:19:06,588 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:19:06,588 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:19:06" (1/1) ... [2024-11-13 21:19:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:19:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 45 states and 47 transitions. [2024-11-13 21:19:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2024-11-13 21:19:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 21:19:06,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 44 states and 46 transitions. [2024-11-13 21:19:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-11-13 21:19:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 21:19:07,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:07,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 43 states and 45 transitions. [2024-11-13 21:19:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2024-11-13 21:19:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:19:07,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 42 states and 44 transitions. [2024-11-13 21:19:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-11-13 21:19:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:19:07,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:08,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-13 21:19:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 41 states and 43 transitions. [2024-11-13 21:19:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-13 21:19:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:19:08,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:08,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-13 21:19:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 40 states and 42 transitions. [2024-11-13 21:19:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-11-13 21:19:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:19:09,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 39 states and 41 transitions. [2024-11-13 21:19:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-13 21:19:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 21:19:09,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 38 states and 40 transitions. [2024-11-13 21:19:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-13 21:19:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 21:19:10,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:10,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 37 states and 39 transitions. [2024-11-13 21:19:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-13 21:19:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:19:11,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 38 states and 40 transitions. [2024-11-13 21:19:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-13 21:19:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:19:12,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-13 21:19:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-13 21:19:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:19:13,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 41 states and 46 transitions. [2024-11-13 21:19:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-13 21:19:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:19:13,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 43 states and 50 transitions. [2024-11-13 21:19:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-11-13 21:19:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:19:14,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 46 states and 56 transitions. [2024-11-13 21:19:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-13 21:19:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:19:15,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 50 states and 64 transitions. [2024-11-13 21:19:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-11-13 21:19:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:19:15,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:15,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 55 states and 77 transitions. [2024-11-13 21:19:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2024-11-13 21:19:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:19:16,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:16,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:16,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-13 21:19:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 60 states and 90 transitions. [2024-11-13 21:19:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-13 21:19:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:19:16,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:16,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:16,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-13 21:19:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 61 states and 91 transitions. [2024-11-13 21:19:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2024-11-13 21:19:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:19:17,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 63 states and 96 transitions. [2024-11-13 21:19:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-11-13 21:19:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:19:17,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 66 states and 106 transitions. [2024-11-13 21:19:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 106 transitions. [2024-11-13 21:19:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:19:17,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 72 states and 122 transitions. [2024-11-13 21:19:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 122 transitions. [2024-11-13 21:19:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:19:21,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 74 states and 126 transitions. [2024-11-13 21:19:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 126 transitions. [2024-11-13 21:19:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:19:22,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 79 states and 142 transitions. [2024-11-13 21:19:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 142 transitions. [2024-11-13 21:19:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:19:23,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 85 states and 159 transitions. [2024-11-13 21:19:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 159 transitions. [2024-11-13 21:19:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:19:25,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 87 states and 161 transitions. [2024-11-13 21:19:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 161 transitions. [2024-11-13 21:19:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:19:26,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 92 states and 171 transitions. [2024-11-13 21:19:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2024-11-13 21:19:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:19:31,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:31,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 93 states and 173 transitions. [2024-11-13 21:19:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2024-11-13 21:19:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:19:32,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:32,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 93 states and 172 transitions. [2024-11-13 21:19:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 172 transitions. [2024-11-13 21:19:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:19:32,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 97 states and 181 transitions. [2024-11-13 21:19:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 181 transitions. [2024-11-13 21:19:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:19:33,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:33,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:33,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-13 21:19:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 102 states and 192 transitions. [2024-11-13 21:19:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 192 transitions. [2024-11-13 21:19:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:19:34,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:34,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 101 states and 191 transitions. [2024-11-13 21:19:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 191 transitions. [2024-11-13 21:19:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:19:34,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:19:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 102 states and 195 transitions. [2024-11-13 21:19:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 195 transitions. [2024-11-13 21:19:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 21:19:34,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:34,670 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-13 21:19:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 103 states and 196 transitions. [2024-11-13 21:19:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 196 transitions. [2024-11-13 21:19:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 21:19:35,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:35,790 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-13 21:19:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 103 states and 195 transitions. [2024-11-13 21:19:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 195 transitions. [2024-11-13 21:19:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:19:36,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:36,283 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-13 21:19:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 108 states and 203 transitions. [2024-11-13 21:19:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 203 transitions. [2024-11-13 21:19:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:19:37,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:37,583 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-13 21:19:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 113 states and 211 transitions. [2024-11-13 21:19:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 211 transitions. [2024-11-13 21:19:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:19:38,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:38,687 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-13 21:19:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 114 states and 212 transitions. [2024-11-13 21:19:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 212 transitions. [2024-11-13 21:19:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:19:39,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:39,224 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-13 21:19:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 113 states and 210 transitions. [2024-11-13 21:19:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 210 transitions. [2024-11-13 21:19:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:19:39,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:39,824 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-13 21:19:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 114 states and 210 transitions. [2024-11-13 21:19:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 210 transitions. [2024-11-13 21:19:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:19:40,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:40,429 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-13 21:19:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 118 states and 217 transitions. [2024-11-13 21:19:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 217 transitions. [2024-11-13 21:19:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:19:41,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:41,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:41,226 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-13 21:19:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 123 states and 223 transitions. [2024-11-13 21:19:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 223 transitions. [2024-11-13 21:19:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:19:42,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:42,446 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-13 21:19:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 124 states and 223 transitions. [2024-11-13 21:19:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 223 transitions. [2024-11-13 21:19:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:19:43,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:43,663 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-13 21:19:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 131 states and 232 transitions. [2024-11-13 21:19:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 232 transitions. [2024-11-13 21:19:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:19:46,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:46,748 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-13 21:19:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 132 states and 232 transitions. [2024-11-13 21:19:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 232 transitions. [2024-11-13 21:19:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:19:47,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:19:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 131 states and 229 transitions. [2024-11-13 21:19:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 229 transitions. [2024-11-13 21:19:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:19:48,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:19:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 136 states and 244 transitions. [2024-11-13 21:19:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 244 transitions. [2024-11-13 21:19:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:19:51,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:19:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 138 states and 246 transitions. [2024-11-13 21:19:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 246 transitions. [2024-11-13 21:19:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:19:52,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:19:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 141 states and 247 transitions. [2024-11-13 21:19:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 247 transitions. [2024-11-13 21:19:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:19:53,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:19:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 25 states and 30 transitions. [2024-11-13 21:19:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-13 21:19:54,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:19:54,256 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 49 iterations. [2024-11-13 21:19:54,268 INFO L729 CodeCheckObserver]: All specifications hold 27 specifications checked. All of them hold [2024-11-13 21:19:55,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 563 565) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,858 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,859 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,862 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,863 INFO L77 FloydHoareUtils]: At program point L557-3(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,863 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,863 INFO L77 FloydHoareUtils]: At program point L557-4(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,863 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,864 INFO L77 FloydHoareUtils]: At program point L557-7(lines 557 560) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse8 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) .cse1 .cse2 .cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) .cse4 .cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) .cse6 .cse7 .cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) .cse9) (and .cse0 (not |ULTIMATE.start_test_fun_#t~short10#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2024-11-13 21:19:55,864 INFO L77 FloydHoareUtils]: At program point L557-9(lines 557 560) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,864 INFO L77 FloydHoareUtils]: At program point L557-10(lines 557 560) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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-13 21:19:55,864 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:19:55,864 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,864 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,864 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,865 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,865 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,865 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,865 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,865 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,865 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,866 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:19:55,866 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,867 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,867 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,867 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,867 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,867 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:19:55,867 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,868 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,868 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK(lines 563 565) no Hoare annotation was computed. [2024-11-13 21:19:55,868 INFO L77 FloydHoareUtils]: At program point L555(line 555) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~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_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (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) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#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|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 21:19:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:19:55,876 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:19:55,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 21:19:55,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:19:55,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:19:55,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:19:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:19:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 21:19:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:19:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:19:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:19:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:19:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:19:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 21:19:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:19:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:19:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:19:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:19:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:19:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 21:19:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 21:19:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:19:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 21:19:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:19:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:19:55,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:19:55,888 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:19:55,888 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:19:55,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:19:55 ImpRootNode [2024-11-13 21:19:55,889 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:19:55,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:19:55,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:19:55,890 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:19:55,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:19:06" (3/4) ... [2024-11-13 21:19:55,895 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:19:55,902 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-13 21:19:55,902 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 21:19:55,902 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 21:19:55,902 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 21:19:55,973 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:19:55,973 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:19:55,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:19:55,974 INFO L158 Benchmark]: Toolchain (without parser) took 50374.97ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 118.1MB in the beginning and 214.1MB in the end (delta: -96.0MB). Peak memory consumption was 238.7MB. Max. memory is 16.1GB. [2024-11-13 21:19:55,975 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:19:55,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.68ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 102.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:19:55,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.23ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 100.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:19:55,976 INFO L158 Benchmark]: Boogie Preprocessor took 21.26ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:19:55,976 INFO L158 Benchmark]: RCFGBuilder took 515.36ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:19:55,976 INFO L158 Benchmark]: CodeCheck took 49313.42ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 80.2MB in the beginning and 218.4MB in the end (delta: -138.2MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. [2024-11-13 21:19:55,977 INFO L158 Benchmark]: Witness Printer took 84.08ms. Allocated memory is still 478.2MB. Free memory was 218.4MB in the beginning and 214.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:19:55,978 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, 45 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 47.6s, OverallIterations: 49, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9223 SdHoareTripleChecker+Valid, 47.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8731 mSDsluCounter, 3392 SdHoareTripleChecker+Invalid, 41.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2812 mSDsCounter, 2441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23834 IncrementalHoareTripleChecker+Invalid, 26275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2441 mSolverCounterUnsat, 580 mSDtfsCounter, 23834 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5469 GetRequests, 4831 SyntacticMatches, 232 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87017 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 6506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 69/69 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.68ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 102.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.23ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 100.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.26ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 515.36ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 49313.42ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 80.2MB in the beginning and 218.4MB in the end (delta: -138.2MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. * Witness Printer took 84.08ms. Allocated memory is still 478.2MB. Free memory was 218.4MB in the beginning and 214.1MB in the end (delta: 4.3MB). 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: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - 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~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!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: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!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: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - 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~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - 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: ~x_ref~0!offset - 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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset - 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: ~y_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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-11-13 21:19:56,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a57ea70a-f1eb-41b7-a5ac-66ccc45edce2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE