./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.11-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_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/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_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/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_393abc04-a277-46f9-b2e0-4f843ca4e2b0/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 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:44:37,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:44:37,648 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-13 20:44:37,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:44:37,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:44:37,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:44:37,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:44:37,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:44:37,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:44:37,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:44:37,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:44:37,685 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 20:44:37,685 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 20:44:37,685 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 20:44:37,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:44:37,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:44:37,686 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 20:44:37,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:44:37,687 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:44:37,687 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:44:37,688 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:44:37,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:44:37,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:44:37,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:44:37,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:44:37,688 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:44:37,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:44:37,688 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_393abc04-a277-46f9-b2e0-4f843ca4e2b0/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 -> 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 [2024-11-13 20:44:37,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:44:38,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:44:38,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:44:38,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:44:38,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:44:38,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i Unable to find full path for "g++" [2024-11-13 20:44:39,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:44:40,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:44:40,180 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-11-13 20:44:40,193 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/data/d619c2fd6/39bf97e9e1184a999be6834809a3df3e/FLAGec7339901 [2024-11-13 20:44:40,207 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/data/d619c2fd6/39bf97e9e1184a999be6834809a3df3e [2024-11-13 20:44:40,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:44:40,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:44:40,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:44:40,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:44:40,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:44:40,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f878094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40, skipping insertion in model container [2024-11-13 20:44:40,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:44:40,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:44:40,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:44:40,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:44:40,714 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:44:40,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40 WrapperNode [2024-11-13 20:44:40,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:44:40,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:44:40,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:44:40,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:44:40,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,747 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-11-13 20:44:40,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:44:40,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:44:40,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:44:40,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:44:40,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:44:40,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:44:40,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:44:40,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:44:40,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:44:40" (1/1) ... [2024-11-13 20:44:40,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:44:40,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:44:40,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:44:40,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:44:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 20:44:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 20:44:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 20:44:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 20:44:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:44:40,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:44:40,926 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:44:40,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:44:41,232 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-13 20:44:41,233 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:44:41,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:44:41,302 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:44:41,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:44:41 BoogieIcfgContainer [2024-11-13 20:44:41,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:44:41,303 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:44:41,303 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:44:41,312 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:44:41,312 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:44:41" (1/1) ... [2024-11-13 20:44:41,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:44:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 80 states and 87 transitions. [2024-11-13 20:44:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-13 20:44:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 20:44:41,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:41,688 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 20:44:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 79 states and 86 transitions. [2024-11-13 20:44:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-13 20:44:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 20:44:41,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:41,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:41,986 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 20:44:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 78 states and 85 transitions. [2024-11-13 20:44:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-13 20:44:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:44:42,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:42,195 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 20:44:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 77 states and 84 transitions. [2024-11-13 20:44:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-13 20:44:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:44:42,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:42,470 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 20:44:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-11-13 20:44:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-13 20:44:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:44:42,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:42,874 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 20:44:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-11-13 20:44:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-13 20:44:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:44:43,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:43,340 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 20:44:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 74 states and 81 transitions. [2024-11-13 20:44:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-13 20:44:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:44:43,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:43,980 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 20:44:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-11-13 20:44:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-13 20:44:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:44:44,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:44,436 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 20:44:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 76 states and 86 transitions. [2024-11-13 20:44:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-11-13 20:44:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:44:44,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:44,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:44,849 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 20:44:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 79 states and 93 transitions. [2024-11-13 20:44:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-13 20:44:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:44:45,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:45,201 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 20:44:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 82 states and 101 transitions. [2024-11-13 20:44:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-11-13 20:44:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:44:45,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:45,987 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 20:44:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 83 states and 103 transitions. [2024-11-13 20:44:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2024-11-13 20:44:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:44:46,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,236 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 20:44:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 86 states and 108 transitions. [2024-11-13 20:44:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-11-13 20:44:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:44:46,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:44:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 89 states and 114 transitions. [2024-11-13 20:44:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2024-11-13 20:44:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:44:46,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:44:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 92 states and 120 transitions. [2024-11-13 20:44:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2024-11-13 20:44:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:44:46,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,576 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 20:44:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 95 states and 125 transitions. [2024-11-13 20:44:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-11-13 20:44:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:44:46,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,647 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 20:44:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 98 states and 130 transitions. [2024-11-13 20:44:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2024-11-13 20:44:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:44:46,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,713 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 20:44:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 103 states and 139 transitions. [2024-11-13 20:44:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-11-13 20:44:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:44:46,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,782 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 20:44:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 108 states and 148 transitions. [2024-11-13 20:44:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2024-11-13 20:44:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:44:46,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:46,847 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 20:44:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 116 states and 170 transitions. [2024-11-13 20:44:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-13 20:44:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:44:47,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:47,290 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 20:44:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 124 states and 192 transitions. [2024-11-13 20:44:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 192 transitions. [2024-11-13 20:44:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:44:47,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:44:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 125 states and 193 transitions. [2024-11-13 20:44:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-11-13 20:44:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:44:47,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:47,892 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 20:44:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 129 states and 202 transitions. [2024-11-13 20:44:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 202 transitions. [2024-11-13 20:44:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:44:47,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:47,978 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 20:44:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 133 states and 214 transitions. [2024-11-13 20:44:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 214 transitions. [2024-11-13 20:44:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:44:48,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:48,064 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 20:44:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 134 states and 216 transitions. [2024-11-13 20:44:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 216 transitions. [2024-11-13 20:44:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:44:48,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:48,146 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 20:44:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 137 states and 221 transitions. [2024-11-13 20:44:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 221 transitions. [2024-11-13 20:44:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:44:48,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:48,205 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 20:44:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 137 states and 220 transitions. [2024-11-13 20:44:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 220 transitions. [2024-11-13 20:44:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:44:48,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:48,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:48,291 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 20:44:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 138 states and 220 transitions. [2024-11-13 20:44:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 220 transitions. [2024-11-13 20:44:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:44:48,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:48,453 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 20:44:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 140 states and 222 transitions. [2024-11-13 20:44:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 222 transitions. [2024-11-13 20:44:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:44:49,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:49,082 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 20:44:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 142 states and 225 transitions. [2024-11-13 20:44:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 225 transitions. [2024-11-13 20:44:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:44:49,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:44:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 144 states and 226 transitions. [2024-11-13 20:44:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2024-11-13 20:44:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:44:49,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:49,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:49,507 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 20:44:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 145 states and 228 transitions. [2024-11-13 20:44:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 228 transitions. [2024-11-13 20:44:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:44:49,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:49,560 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 20:44:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 146 states and 230 transitions. [2024-11-13 20:44:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 230 transitions. [2024-11-13 20:44:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:44:49,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:49,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:49,623 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 20:44:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 148 states and 232 transitions. [2024-11-13 20:44:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 232 transitions. [2024-11-13 20:44:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:44:49,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:49,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:50,149 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 20:44:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 152 states and 238 transitions. [2024-11-13 20:44:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2024-11-13 20:44:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:44:51,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:51,657 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 20:44:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 154 states and 240 transitions. [2024-11-13 20:44:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2024-11-13 20:44:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:44:51,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:51,948 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 20:44:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 156 states and 245 transitions. [2024-11-13 20:44:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 245 transitions. [2024-11-13 20:44:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:44:52,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:44:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 158 states and 247 transitions. [2024-11-13 20:44:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2024-11-13 20:44:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:44:52,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:52,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:52,912 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 20:44:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 161 states and 254 transitions. [2024-11-13 20:44:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 254 transitions. [2024-11-13 20:44:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:44:53,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:53,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:53,422 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 20:44:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 164 states and 261 transitions. [2024-11-13 20:44:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 261 transitions. [2024-11-13 20:44:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:44:54,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:54,717 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 20:44:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 177 states and 290 transitions. [2024-11-13 20:44:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 290 transitions. [2024-11-13 20:44:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:44:58,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:58,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:58,339 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 20:44:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 180 states and 295 transitions. [2024-11-13 20:44:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 295 transitions. [2024-11-13 20:44:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:44:59,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:59,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:59,420 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 20:44:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 182 states and 300 transitions. [2024-11-13 20:44:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 300 transitions. [2024-11-13 20:44:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:44:59,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:59,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:59,881 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 20:45:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 184 states and 301 transitions. [2024-11-13 20:45:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2024-11-13 20:45:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:45:00,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:00,401 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 20:45:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 187 states and 307 transitions. [2024-11-13 20:45:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 307 transitions. [2024-11-13 20:45:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:45:00,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:00,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:00,471 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 20:45:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 190 states and 312 transitions. [2024-11-13 20:45:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 312 transitions. [2024-11-13 20:45:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:45:01,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:01,709 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 20:45:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 190 states and 311 transitions. [2024-11-13 20:45:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 311 transitions. [2024-11-13 20:45:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:45:02,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:02,186 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 20:45:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 195 states and 317 transitions. [2024-11-13 20:45:03,668 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 317 transitions. [2024-11-13 20:45:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:45:03,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 199 states and 321 transitions. [2024-11-13 20:45:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 321 transitions. [2024-11-13 20:45:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:45:04,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:04,859 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 20:45:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 201 states and 323 transitions. [2024-11-13 20:45:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 323 transitions. [2024-11-13 20:45:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 20:45:05,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:05,424 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 20:45:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 208 states and 335 transitions. [2024-11-13 20:45:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 335 transitions. [2024-11-13 20:45:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 20:45:09,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:09,498 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 20:45:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 210 states and 336 transitions. [2024-11-13 20:45:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 336 transitions. [2024-11-13 20:45:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 20:45:10,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 212 states and 337 transitions. [2024-11-13 20:45:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 337 transitions. [2024-11-13 20:45:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 20:45:12,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:13,520 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 20:45:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 218 states and 344 transitions. [2024-11-13 20:45:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 344 transitions. [2024-11-13 20:45:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:45:17,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:17,817 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 20:45:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 220 states and 348 transitions. [2024-11-13 20:45:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 348 transitions. [2024-11-13 20:45:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:45:17,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:17,883 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 20:45:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 223 states and 353 transitions. [2024-11-13 20:45:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 353 transitions. [2024-11-13 20:45:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:45:17,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:17,964 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 20:45:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 356 transitions. [2024-11-13 20:45:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 356 transitions. [2024-11-13 20:45:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:45:18,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:18,023 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 20:45:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 225 states and 356 transitions. [2024-11-13 20:45:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 356 transitions. [2024-11-13 20:45:18,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:45:18,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:18,242 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 20:45:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 224 states and 355 transitions. [2024-11-13 20:45:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 355 transitions. [2024-11-13 20:45:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:45:18,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:18,363 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 20:45:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 225 states and 355 transitions. [2024-11-13 20:45:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 355 transitions. [2024-11-13 20:45:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:45:18,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 226 states and 357 transitions. [2024-11-13 20:45:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 357 transitions. [2024-11-13 20:45:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:45:18,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 229 states and 362 transitions. [2024-11-13 20:45:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 362 transitions. [2024-11-13 20:45:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:45:18,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:19,934 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 20:45:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 230 states and 363 transitions. [2024-11-13 20:45:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 363 transitions. [2024-11-13 20:45:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:45:20,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 232 states and 367 transitions. [2024-11-13 20:45:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 367 transitions. [2024-11-13 20:45:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:45:21,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:21,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 20:45:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 235 states and 372 transitions. [2024-11-13 20:45:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 372 transitions. [2024-11-13 20:45:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:45:21,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:21,164 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 20:45:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 236 states and 375 transitions. [2024-11-13 20:45:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 375 transitions. [2024-11-13 20:45:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:45:21,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:21,224 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 20:45:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 238 states and 380 transitions. [2024-11-13 20:45:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 380 transitions. [2024-11-13 20:45:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:45:21,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:45:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 240 states and 382 transitions. [2024-11-13 20:45:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 382 transitions. [2024-11-13 20:45:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:45:21,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:45:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 240 states and 381 transitions. [2024-11-13 20:45:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 381 transitions. [2024-11-13 20:45:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:45:22,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,194 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 20:45:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 239 states and 380 transitions. [2024-11-13 20:45:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 380 transitions. [2024-11-13 20:45:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:45:22,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,256 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 20:45:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 240 states and 380 transitions. [2024-11-13 20:45:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 380 transitions. [2024-11-13 20:45:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:45:22,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,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 20:45:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 239 states and 379 transitions. [2024-11-13 20:45:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 379 transitions. [2024-11-13 20:45:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:45:22,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,389 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 20:45:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 240 states and 381 transitions. [2024-11-13 20:45:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 381 transitions. [2024-11-13 20:45:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:45:22,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,470 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 20:45:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 242 states and 382 transitions. [2024-11-13 20:45:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 382 transitions. [2024-11-13 20:45:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:45:22,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,544 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 20:45:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 244 states and 383 transitions. [2024-11-13 20:45:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 383 transitions. [2024-11-13 20:45:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 20:45:22,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:45:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 244 states and 382 transitions. [2024-11-13 20:45:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 382 transitions. [2024-11-13 20:45:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 20:45:22,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:45:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 246 states and 383 transitions. [2024-11-13 20:45:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 383 transitions. [2024-11-13 20:45:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 20:45:22,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,790 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 20:45:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 251 states and 390 transitions. [2024-11-13 20:45:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 390 transitions. [2024-11-13 20:45:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 20:45:22,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,885 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 20:45:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 256 states and 395 transitions. [2024-11-13 20:45:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 395 transitions. [2024-11-13 20:45:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 20:45:22,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:22,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:45:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 258 states and 397 transitions. [2024-11-13 20:45:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 397 transitions. [2024-11-13 20:45:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 20:45:24,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:45:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 260 states and 400 transitions. [2024-11-13 20:45:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 400 transitions. [2024-11-13 20:45:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 20:45:25,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:45:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 266 states and 409 transitions. [2024-11-13 20:45:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2024-11-13 20:45:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 20:45:34,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:45:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 268 states and 411 transitions. [2024-11-13 20:45:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 411 transitions. [2024-11-13 20:45:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 20:45:35,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:45:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 270 states and 413 transitions. [2024-11-13 20:45:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 413 transitions. [2024-11-13 20:45:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 20:45:36,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:36,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:45:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 272 states and 415 transitions. [2024-11-13 20:45:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 415 transitions. [2024-11-13 20:45:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 20:45:37,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:45:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 274 states and 418 transitions. [2024-11-13 20:45:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 418 transitions. [2024-11-13 20:45:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 20:45:38,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:45:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 276 states and 420 transitions. [2024-11-13 20:45:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 420 transitions. [2024-11-13 20:45:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 20:45:39,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:45:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 278 states and 422 transitions. [2024-11-13 20:45:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 422 transitions. [2024-11-13 20:45:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 20:45:40,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 20:45:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 280 states and 424 transitions. [2024-11-13 20:45:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 424 transitions. [2024-11-13 20:45:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 20:45:41,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 20:45:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 282 states and 427 transitions. [2024-11-13 20:45:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 427 transitions. [2024-11-13 20:45:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:45:43,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:45:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 287 states and 433 transitions. [2024-11-13 20:45:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 433 transitions. [2024-11-13 20:45:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:45:43,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:45:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 289 states and 434 transitions. [2024-11-13 20:45:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 434 transitions. [2024-11-13 20:45:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:45:44,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:45:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 294 states and 439 transitions. [2024-11-13 20:45:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2024-11-13 20:45:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:45:44,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:44,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:45:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 296 states and 442 transitions. [2024-11-13 20:45:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 442 transitions. [2024-11-13 20:45:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:45:44,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:45:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 87 states and 110 transitions. [2024-11-13 20:45:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-11-13 20:45:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 20:45:44,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:45:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:45:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:45:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:46:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:46:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 116 states and 163 transitions. [2024-11-13 20:46:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-13 20:46:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 20:46:15,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:46:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:46:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:46:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:46:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:46:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 125 states and 174 transitions. [2024-11-13 20:46:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2024-11-13 20:46:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:46:23,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:46:23,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:46:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:46:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:47:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:47:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 142 states and 205 transitions. [2024-11-13 20:47:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2024-11-13 20:47:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:47:00,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:47:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:47:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:47:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:47:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:47:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 149 states and 220 transitions. [2024-11-13 20:47:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 220 transitions. [2024-11-13 20:47:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 20:47:26,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:47:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:47:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:47:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:47:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:47:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 160 states and 244 transitions. [2024-11-13 20:47:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2024-11-13 20:47:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:47:49,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:47:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:47:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:47:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 160 states and 243 transitions. [2024-11-13 20:48:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 243 transitions. [2024-11-13 20:48:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 20:48:08,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 170 states and 256 transitions. [2024-11-13 20:48:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 256 transitions. [2024-11-13 20:48:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 20:48:23,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:48:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 174 states and 261 transitions. [2024-11-13 20:48:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 261 transitions. [2024-11-13 20:48:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 20:48:37,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 187 states and 282 transitions. [2024-11-13 20:49:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2024-11-13 20:49:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 20:49:06,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 189 states and 284 transitions. [2024-11-13 20:49:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2024-11-13 20:49:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 20:49:22,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:49:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 61 states and 71 transitions. [2024-11-13 20:49:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-11-13 20:49:26,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 20:49:26,204 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 106 iterations. [2024-11-13 20:49:26,217 INFO L729 CodeCheckObserver]: All specifications hold 45 specifications checked. All of them hold [2024-11-13 20:49:39,406 INFO L77 FloydHoareUtils]: At program point L555-11(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.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 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.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 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-13 20:49:39,406 INFO L77 FloydHoareUtils]: At program point L555-12(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (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|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,406 INFO L77 FloydHoareUtils]: At program point L555-13(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (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|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,407 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,407 INFO L77 FloydHoareUtils]: At program point L555-16(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.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 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.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 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 0) .cse4 .cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse7 .cse8 .cse9))) [2024-11-13 20:49:39,407 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,408 INFO L77 FloydHoareUtils]: At program point L555-17(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.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 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.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)) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse12 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not |ULTIMATE.start_test_fun_#t~short13#1|) .cse7 .cse8 .cse9) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (< (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse10) 2147483647) .cse4 .cse5 .cse11 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ .cse10 1) 0) .cse4 .cse5 .cse11 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9))) [2024-11-13 20:49:39,408 INFO L77 FloydHoareUtils]: At program point L555-18(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse2) 2147483646) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse8 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 (<= (+ .cse2 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2024-11-13 20:49:39,409 INFO L77 FloydHoareUtils]: At program point L555-19(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse2) 2147483646) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 (<= (+ .cse2 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2024-11-13 20:49:39,409 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,409 INFO L77 FloydHoareUtils]: At program point L555-20(line 555) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (= .cse2 |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse2) 2147483646) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= (+ .cse2 1) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2024-11-13 20:49:39,410 INFO L77 FloydHoareUtils]: At program point L555-23(lines 555 565) the Hoare annotation is: (let ((.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (+ .cse11 .cse10)) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse2 2147483646) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or (not (= .cse10 0)) (< 0 .cse11)) .cse12 .cse13 .cse14 .cse15 (or (< 0 .cse10) (not (= .cse11 .cse10)))) (and .cse1 .cse3 .cse5 .cse6 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 (<= (+ .cse10 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 (< 2147483646 .cse2) .cse13 .cse14 .cse15)))) [2024-11-13 20:49:39,410 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,410 INFO L77 FloydHoareUtils]: At program point L555-25(lines 555 565) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,410 INFO L77 FloydHoareUtils]: At program point L556(line 556) the Hoare annotation is: (let ((.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (+ .cse11 .cse10)) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse2 2147483646) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or (not (= .cse10 0)) (< 0 .cse11)) .cse12 .cse13 .cse14 .cse15 (or (< 0 .cse10) (not (= .cse11 .cse10)))) (and .cse0 .cse1 .cse3 .cse4 (<= (+ .cse10 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 (< 2147483646 .cse2) .cse13 .cse14 .cse15)))) [2024-11-13 20:49:39,413 INFO L77 FloydHoareUtils]: At program point L556-1(line 556) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse12 (+ .cse16 .cse5)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (= .cse5 |ULTIMATE.start_test_fun_#t~mem17#1|)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 1) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< 2147483646 .cse12) .cse13 .cse14 .cse15) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse12 2147483646) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (or (not (= .cse5 0)) (< 0 .cse16)) .cse11 .cse13 .cse14 .cse15 (or (< 0 .cse5) (not (= .cse16 .cse5))))))) [2024-11-13 20:49:39,413 INFO L77 FloydHoareUtils]: At program point L556-2(lines 556 564) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.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 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (= .cse5 |ULTIMATE.start_test_fun_#t~mem17#1|)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse15 (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse5))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse4 (or (not (= .cse5 0)) (< 0 |ULTIMATE.start_test_fun_#t~mem18#1|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ .cse5 |ULTIMATE.start_test_fun_#t~mem18#1|) 2147483646) .cse12 .cse13 .cse14 (or (< 0 .cse5) .cse15)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 1) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12 .cse13 .cse14)))) [2024-11-13 20:49:39,413 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 568 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 20:49:39,413 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK(lines 568 570) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,414 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,414 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,415 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,415 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,415 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 20:49:39,415 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,415 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,415 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,415 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,415 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse0 1073741823) (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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)) (or (< 0 .cse0) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) [2024-11-13 20:49:39,415 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse0 1073741823) (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|)) (or (< 0 .cse0) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem20#1|))) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 |ULTIMATE.start_test_fun_#t~mem20#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 20:49:39,416 INFO L77 FloydHoareUtils]: At program point L559-2(lines 559 563) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or (< 0 .cse0) (not (= |ULTIMATE.start_test_fun_#t~mem21#1| |ULTIMATE.start_test_fun_#t~mem20#1|))) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse0 1073741823) (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|)) (= .cse0 |ULTIMATE.start_test_fun_#t~mem20#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem21#1|) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 20:49:39,416 INFO L77 FloydHoareUtils]: At program point L559-4(lines 555 565) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,416 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,416 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse0 1073741823) (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) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 .cse0) (= (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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 20:49:39,418 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= .cse0 |ULTIMATE.start_test_fun_#t~mem22#1|) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse0 1073741823) (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) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 .cse0) (= (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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 20:49:39,418 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,419 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (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) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,419 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (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) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,419 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,419 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,419 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,419 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,420 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,420 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 20:49:39,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,421 INFO L77 FloydHoareUtils]: At program point L562(line 562) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,421 INFO L77 FloydHoareUtils]: At program point L562-1(line 562) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,422 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,422 INFO L77 FloydHoareUtils]: At program point L555-1(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or |ULTIMATE.start_test_fun_#t~short8#1| (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,423 INFO L77 FloydHoareUtils]: At program point L555-2(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,423 INFO L77 FloydHoareUtils]: At program point L555-3(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem7#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,423 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,423 INFO L77 FloydHoareUtils]: At program point L555-6(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.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 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.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 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not |ULTIMATE.start_test_fun_#t~short8#1|) .cse11 .cse12) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (< (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) 2147483647) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-11-13 20:49:39,423 INFO L77 FloydHoareUtils]: At program point L555-7(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.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 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.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 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (< (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) 2147483647) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not |ULTIMATE.start_test_fun_#t~short13#1|) .cse10 .cse11 .cse12))) [2024-11-13 20:49:39,426 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:49:39,426 INFO L77 FloydHoareUtils]: At program point L555-9(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (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|)) (= |ULTIMATE.start_test_fun_~x_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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:49:39,437 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:49:39,438 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:49:39,440 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:49:39,441 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 20:49:39,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:49:39,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:49:39,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 20:49:39,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 20:49:39,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:49:39,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:49:39,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:49:39,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:49:39 ImpRootNode [2024-11-13 20:49:39,447 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:49:39,448 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:49:39,448 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:49:39,448 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:49:39,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:44:41" (3/4) ... [2024-11-13 20:49:39,452 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 20:49:39,462 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-13 20:49:39,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 20:49:39,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 20:49:39,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 20:49:39,558 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:49:39,558 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 20:49:39,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:49:39,560 INFO L158 Benchmark]: Toolchain (without parser) took 299348.12ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 92.8MB in the beginning and 1.0GB in the end (delta: -929.1MB). Peak memory consumption was 849.1MB. Max. memory is 16.1GB. [2024-11-13 20:49:39,560 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:49:39,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.50ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:49:39,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:49:39,562 INFO L158 Benchmark]: Boogie Preprocessor took 19.42ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.8MB in the end (delta: 919.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:49:39,563 INFO L158 Benchmark]: RCFGBuilder took 535.01ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 50.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:49:39,563 INFO L158 Benchmark]: CodeCheck took 298144.18ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 50.0MB in the beginning and 1.0GB in the end (delta: -976.4MB). Peak memory consumption was 798.8MB. Max. memory is 16.1GB. [2024-11-13 20:49:39,563 INFO L158 Benchmark]: Witness Printer took 110.77ms. Allocated memory is still 1.9GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:49:39,566 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, 80 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 284.9s, OverallIterations: 106, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40245 SdHoareTripleChecker+Valid, 136.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38129 mSDsluCounter, 31677 SdHoareTripleChecker+Invalid, 120.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26718 mSDsCounter, 13045 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82028 IncrementalHoareTripleChecker+Invalid, 95073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13045 mSolverCounterUnsat, 4959 mSDtfsCounter, 82028 mSolverCounterSat, 2.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19401 GetRequests, 17673 SyntacticMatches, 680 SemanticMatches, 1048 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580222 ImplicationChecksByTransitivity, 269.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 2225 NumberOfCodeBlocks, 2225 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 2120 ConstructedInterpolants, 0 QuantifiedInterpolants, 17931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 105 InterpolantComputations, 96 PerfectInterpolantSequences, 366/400 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.50ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.42ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.8MB in the end (delta: 919.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 535.01ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 50.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 298144.18ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 50.0MB in the beginning and 1.0GB in the end (delta: -976.4MB). Peak memory consumption was 798.8MB. Max. memory is 16.1GB. * Witness Printer took 110.77ms. Allocated memory is still 1.9GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 4.5MB). 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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: 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] RESULT: Ultimate proved your program to be correct! [2024-11-13 20:49:39,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_393abc04-a277-46f9-b2e0-4f843ca4e2b0/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