./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/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_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b --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-d790fec [2024-12-06 05:20:05,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:20:05,258 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-12-06 05:20:05,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:20:05,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:20:05,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:20:05,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:20:05,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:20:05,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:20:05,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:20:05,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:20:05,283 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:20:05,284 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:20:05,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:20:05,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:20:05,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:20:05,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:20:05,285 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:20:05,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:20:05,285 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_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b 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-12-06 05:20:05,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:20:05,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:20:05,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:20:05,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:20:05,531 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:20:05,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-12-06 05:20:08,194 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/data/a548a5729/a9d6815347d04f2282566ac36da01395/FLAG9c869495b [2024-12-06 05:20:08,418 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:20:08,418 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2024-12-06 05:20:08,430 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/data/a548a5729/a9d6815347d04f2282566ac36da01395/FLAG9c869495b [2024-12-06 05:20:08,770 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/data/a548a5729/a9d6815347d04f2282566ac36da01395 [2024-12-06 05:20:08,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:20:08,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:20:08,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:20:08,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:20:08,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:20:08,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:20:08" (1/1) ... [2024-12-06 05:20:08,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0b3b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:08, skipping insertion in model container [2024-12-06 05:20:08,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:20:08" (1/1) ... [2024-12-06 05:20:08,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:20:09,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:20:09,021 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:20:09,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:20:09,074 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:20:09,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09 WrapperNode [2024-12-06 05:20:09,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:20:09,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:20:09,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:20:09,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:20:09,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,108 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-12-06 05:20:09,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:20:09,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:20:09,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:20:09,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:20:09,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:20:09,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:20:09,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:20:09,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:20:09,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:20:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:20:09,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:20:09,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:20:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 05:20:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 05:20:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 05:20:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 05:20:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:20:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:20:09,255 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:20:09,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:20:09,511 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-12-06 05:20:09,511 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:20:09,547 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:20:09,547 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 05:20:09,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:20:09 BoogieIcfgContainer [2024-12-06 05:20:09,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:20:09,548 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:20:09,548 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:20:09,554 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:20:09,554 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:20:09" (1/1) ... [2024-12-06 05:20:09,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:20:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 80 states and 87 transitions. [2024-12-06 05:20:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-12-06 05:20:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 05:20:09,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 79 states and 86 transitions. [2024-12-06 05:20:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-12-06 05:20:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 05:20:09,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 78 states and 85 transitions. [2024-12-06 05:20:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-12-06 05:20:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 05:20:10,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 77 states and 84 transitions. [2024-12-06 05:20:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-12-06 05:20:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 05:20:10,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-12-06 05:20:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-12-06 05:20:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 05:20:10,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-12-06 05:20:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-12-06 05:20:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 05:20:10,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 74 states and 81 transitions. [2024-12-06 05:20:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-12-06 05:20:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 05:20:11,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-12-06 05:20:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-12-06 05:20:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 05:20:11,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 76 states and 86 transitions. [2024-12-06 05:20:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-12-06 05:20:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:20:11,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:11,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-12-06 05:20:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 79 states and 93 transitions. [2024-12-06 05:20:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-12-06 05:20:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:20:12,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 82 states and 101 transitions. [2024-12-06 05:20:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-12-06 05:20:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 05:20:12,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 83 states and 103 transitions. [2024-12-06 05:20:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2024-12-06 05:20:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 05:20:12,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 86 states and 108 transitions. [2024-12-06 05:20:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-12-06 05:20:12,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 05:20:12,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 89 states and 114 transitions. [2024-12-06 05:20:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2024-12-06 05:20:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 05:20:12,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:12,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 92 states and 120 transitions. [2024-12-06 05:20:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2024-12-06 05:20:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 05:20:12,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:12,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 95 states and 125 transitions. [2024-12-06 05:20:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-12-06 05:20:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 05:20:13,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 98 states and 130 transitions. [2024-12-06 05:20:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2024-12-06 05:20:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 05:20:13,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 103 states and 139 transitions. [2024-12-06 05:20:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-12-06 05:20:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 05:20:13,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 108 states and 148 transitions. [2024-12-06 05:20:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2024-12-06 05:20:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:20:13,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 109 states and 149 transitions. [2024-12-06 05:20:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2024-12-06 05:20:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:20:13,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:13,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 117 states and 170 transitions. [2024-12-06 05:20:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-12-06 05:20:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:20:13,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 125 states and 191 transitions. [2024-12-06 05:20:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2024-12-06 05:20:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:20:14,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 129 states and 200 transitions. [2024-12-06 05:20:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2024-12-06 05:20:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:20:14,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 133 states and 212 transitions. [2024-12-06 05:20:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 212 transitions. [2024-12-06 05:20:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:20:14,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:14,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-12-06 05:20:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 134 states and 214 transitions. [2024-12-06 05:20:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 214 transitions. [2024-12-06 05:20:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:20:14,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 137 states and 219 transitions. [2024-12-06 05:20:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 219 transitions. [2024-12-06 05:20:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:20:14,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 138 states and 220 transitions. [2024-12-06 05:20:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 220 transitions. [2024-12-06 05:20:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:20:14,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 138 states and 219 transitions. [2024-12-06 05:20:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 219 transitions. [2024-12-06 05:20:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:20:14,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 140 states and 221 transitions. [2024-12-06 05:20:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 221 transitions. [2024-12-06 05:20:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:20:15,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 142 states and 222 transitions. [2024-12-06 05:20:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 222 transitions. [2024-12-06 05:20:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:20:15,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:15,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:15,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-12-06 05:20:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 144 states and 223 transitions. [2024-12-06 05:20:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 223 transitions. [2024-12-06 05:20:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:20:15,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:15,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 145 states and 225 transitions. [2024-12-06 05:20:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2024-12-06 05:20:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:20:15,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 146 states and 227 transitions. [2024-12-06 05:20:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 227 transitions. [2024-12-06 05:20:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:20:15,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 148 states and 229 transitions. [2024-12-06 05:20:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 229 transitions. [2024-12-06 05:20:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:20:15,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:15,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-12-06 05:20:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 152 states and 235 transitions. [2024-12-06 05:20:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2024-12-06 05:20:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 05:20:17,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 154 states and 238 transitions. [2024-12-06 05:20:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2024-12-06 05:20:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 05:20:17,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:17,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-12-06 05:20:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 156 states and 241 transitions. [2024-12-06 05:20:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 241 transitions. [2024-12-06 05:20:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 05:20:17,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 158 states and 244 transitions. [2024-12-06 05:20:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2024-12-06 05:20:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 05:20:17,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 161 states and 251 transitions. [2024-12-06 05:20:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 251 transitions. [2024-12-06 05:20:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:18,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 164 states and 256 transitions. [2024-12-06 05:20:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 256 transitions. [2024-12-06 05:20:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:18,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 177 states and 285 transitions. [2024-12-06 05:20:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 285 transitions. [2024-12-06 05:20:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:21,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 180 states and 290 transitions. [2024-12-06 05:20:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2024-12-06 05:20:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:22,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 181 states and 292 transitions. [2024-12-06 05:20:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 292 transitions. [2024-12-06 05:20:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:22,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 184 states and 296 transitions. [2024-12-06 05:20:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 296 transitions. [2024-12-06 05:20:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:23,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:23,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-12-06 05:20:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 187 states and 300 transitions. [2024-12-06 05:20:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 300 transitions. [2024-12-06 05:20:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:23,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:23,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-12-06 05:20:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 189 states and 301 transitions. [2024-12-06 05:20:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 301 transitions. [2024-12-06 05:20:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:24,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 193 states and 305 transitions. [2024-12-06 05:20:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 305 transitions. [2024-12-06 05:20:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:25,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 197 states and 309 transitions. [2024-12-06 05:20:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 309 transitions. [2024-12-06 05:20:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:25,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:25,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-12-06 05:20:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 197 states and 308 transitions. [2024-12-06 05:20:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 308 transitions. [2024-12-06 05:20:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:20:26,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 199 states and 310 transitions. [2024-12-06 05:20:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 310 transitions. [2024-12-06 05:20:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 05:20:26,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 206 states and 322 transitions. [2024-12-06 05:20:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 322 transitions. [2024-12-06 05:20:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 05:20:29,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 208 states and 323 transitions. [2024-12-06 05:20:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 323 transitions. [2024-12-06 05:20:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 05:20:30,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 210 states and 324 transitions. [2024-12-06 05:20:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2024-12-06 05:20:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 05:20:31,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 216 states and 331 transitions. [2024-12-06 05:20:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 331 transitions. [2024-12-06 05:20:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 05:20:35,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 218 states and 335 transitions. [2024-12-06 05:20:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 335 transitions. [2024-12-06 05:20:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 05:20:35,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:35,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-12-06 05:20:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 221 states and 340 transitions. [2024-12-06 05:20:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 340 transitions. [2024-12-06 05:20:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 05:20:35,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:35,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 222 states and 341 transitions. [2024-12-06 05:20:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 341 transitions. [2024-12-06 05:20:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 05:20:35,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 223 states and 342 transitions. [2024-12-06 05:20:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 342 transitions. [2024-12-06 05:20:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:20:36,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 222 states and 341 transitions. [2024-12-06 05:20:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 341 transitions. [2024-12-06 05:20:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:20:36,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:36,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 223 states and 341 transitions. [2024-12-06 05:20:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 341 transitions. [2024-12-06 05:20:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:20:36,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 224 states and 343 transitions. [2024-12-06 05:20:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 343 transitions. [2024-12-06 05:20:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:20:36,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 227 states and 348 transitions. [2024-12-06 05:20:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 348 transitions. [2024-12-06 05:20:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:20:36,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 228 states and 349 transitions. [2024-12-06 05:20:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 349 transitions. [2024-12-06 05:20:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:20:38,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 227 states and 348 transitions. [2024-12-06 05:20:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 348 transitions. [2024-12-06 05:20:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:20:38,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 229 states and 351 transitions. [2024-12-06 05:20:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 351 transitions. [2024-12-06 05:20:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:20:38,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 230 states and 353 transitions. [2024-12-06 05:20:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2024-12-06 05:20:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:20:38,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 233 states and 358 transitions. [2024-12-06 05:20:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 358 transitions. [2024-12-06 05:20:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:20:38,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:20:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 233 states and 357 transitions. [2024-12-06 05:20:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 357 transitions. [2024-12-06 05:20:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:20:38,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:20:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 235 states and 358 transitions. [2024-12-06 05:20:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 358 transitions. [2024-12-06 05:20:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:20:38,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 234 states and 357 transitions. [2024-12-06 05:20:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 357 transitions. [2024-12-06 05:20:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:20:38,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 235 states and 359 transitions. [2024-12-06 05:20:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 359 transitions. [2024-12-06 05:20:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:20:38,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 234 states and 358 transitions. [2024-12-06 05:20:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2024-12-06 05:20:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:20:38,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 235 states and 358 transitions. [2024-12-06 05:20:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 358 transitions. [2024-12-06 05:20:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 05:20:38,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:20:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 235 states and 357 transitions. [2024-12-06 05:20:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 357 transitions. [2024-12-06 05:20:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 05:20:38,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:20:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 237 states and 358 transitions. [2024-12-06 05:20:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 358 transitions. [2024-12-06 05:20:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 05:20:38,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:20:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 236 states and 356 transitions. [2024-12-06 05:20:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 356 transitions. [2024-12-06 05:20:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 05:20:38,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:20:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 238 states and 357 transitions. [2024-12-06 05:20:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 357 transitions. [2024-12-06 05:20:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:20:38,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 05:20:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 244 states and 365 transitions. [2024-12-06 05:20:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 365 transitions. [2024-12-06 05:20:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:20:39,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 05:20:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 250 states and 371 transitions. [2024-12-06 05:20:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2024-12-06 05:20:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:20:40,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:20:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 252 states and 373 transitions. [2024-12-06 05:20:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2024-12-06 05:20:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:20:40,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:20:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 254 states and 375 transitions. [2024-12-06 05:20:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2024-12-06 05:20:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:20:41,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:41,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:20:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 260 states and 384 transitions. [2024-12-06 05:20:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2024-12-06 05:20:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:20:49,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:49,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:20:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 262 states and 386 transitions. [2024-12-06 05:20:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 386 transitions. [2024-12-06 05:20:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:20:49,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:20:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 264 states and 388 transitions. [2024-12-06 05:20:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2024-12-06 05:20:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:20:50,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:20:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 266 states and 390 transitions. [2024-12-06 05:20:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 390 transitions. [2024-12-06 05:20:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:20:51,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:20:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 268 states and 392 transitions. [2024-12-06 05:20:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2024-12-06 05:20:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:20:52,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:20:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 270 states and 394 transitions. [2024-12-06 05:20:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 394 transitions. [2024-12-06 05:20:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:20:52,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:20:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 272 states and 396 transitions. [2024-12-06 05:20:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 396 transitions. [2024-12-06 05:20:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:20:53,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:20:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 274 states and 398 transitions. [2024-12-06 05:20:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 398 transitions. [2024-12-06 05:20:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:20:54,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:54,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:20:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 276 states and 400 transitions. [2024-12-06 05:20:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 400 transitions. [2024-12-06 05:20:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:20:56,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:20:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 277 states and 401 transitions. [2024-12-06 05:20:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 401 transitions. [2024-12-06 05:20:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:20:56,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:20:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 282 states and 407 transitions. [2024-12-06 05:20:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 407 transitions. [2024-12-06 05:20:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:20:56,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:20:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 287 states and 412 transitions. [2024-12-06 05:20:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 412 transitions. [2024-12-06 05:20:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:20:56,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:20:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 289 states and 414 transitions. [2024-12-06 05:20:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 414 transitions. [2024-12-06 05:20:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:20:56,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:20:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 290 states and 415 transitions. [2024-12-06 05:20:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 415 transitions. [2024-12-06 05:20:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:20:57,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:20:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:20:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 87 states and 110 transitions. [2024-12-06 05:20:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-12-06 05:20:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 05:20:57,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:20:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:20:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:20:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:21:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:21:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 96 states and 120 transitions. [2024-12-06 05:21:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2024-12-06 05:21:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 05:21:04,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:21:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:21:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:21:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:21:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:21:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 125 states and 174 transitions. [2024-12-06 05:21:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2024-12-06 05:21:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:21:28,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:21:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:21:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:21:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:21:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:21:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 142 states and 205 transitions. [2024-12-06 05:21:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2024-12-06 05:21:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:21:56,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:21:56,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:21:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:21:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:22:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:22:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 149 states and 220 transitions. [2024-12-06 05:22:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 220 transitions. [2024-12-06 05:22:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:22:15,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:22:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:22:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:22:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:22:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:22:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 160 states and 244 transitions. [2024-12-06 05:22:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 244 transitions. [2024-12-06 05:22:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 05:22:34,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:22:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:22:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:22:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:22:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:22:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 160 states and 243 transitions. [2024-12-06 05:22:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 243 transitions. [2024-12-06 05:22:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 05:22:48,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:22:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:22:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:22:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:22:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:22:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 170 states and 256 transitions. [2024-12-06 05:22:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 256 transitions. [2024-12-06 05:22:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-06 05:22:59,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:22:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:22:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:23:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 174 states and 262 transitions. [2024-12-06 05:23:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2024-12-06 05:23:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-06 05:23:10,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:23:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 187 states and 283 transitions. [2024-12-06 05:23:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 283 transitions. [2024-12-06 05:23:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-06 05:23:32,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:32,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:23:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 189 states and 286 transitions. [2024-12-06 05:23:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2024-12-06 05:23:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-06 05:23:38,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:23:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 61 states and 71 transitions. [2024-12-06 05:23:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-12-06 05:23:47,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:23:47,553 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 107 iterations. [2024-12-06 05:23:47,562 INFO L726 CodeCheckObserver]: All specifications hold 45 specifications checked. All of them hold [2024-12-06 05:23:57,781 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-12-06 05:23:57,781 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-12-06 05:23:57,782 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-12-06 05:23:57,782 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,782 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-12-06 05:23:57,782 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,783 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-12-06 05:23:57,783 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-12-06 05:23:57,783 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-12-06 05:23:57,783 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,784 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-12-06 05:23:57,784 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-12-06 05:23:57,784 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,785 INFO L77 FloydHoareUtils]: At program point L555-24(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 .cse0 .cse1 .cse3 .cse4 (<= (+ .cse10 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 (< 2147483646 .cse2) .cse13 .cse14 .cse15)))) [2024-12-06 05:23:57,785 INFO L77 FloydHoareUtils]: At program point L555-26(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-12-06 05:23:57,785 INFO L77 FloydHoareUtils]: At program point L556(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-12-06 05:23:57,785 INFO L77 FloydHoareUtils]: At program point L556-1(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-12-06 05:23:57,786 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 568 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK(lines 568 570) no Hoare annotation was computed. [2024-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,786 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-12-06 05:23:57,786 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-12-06 05:23:57,786 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,787 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-12-06 05:23:57,787 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-12-06 05:23:57,787 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-12-06 05:23:57,788 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-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 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-12-06 05:23:57,788 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-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 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-12-06 05:23:57,788 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-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,788 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 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-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 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-12-06 05:23:57,789 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-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,789 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-12-06 05:23:57,789 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-12-06 05:23:57,790 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-12-06 05:23:57,790 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,790 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-12-06 05:23:57,790 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-12-06 05:23:57,790 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:23:57,790 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-12-06 05:23:57,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:23:57,797 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 05:23:57,798 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 05:23:57,799 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 05:23:57,799 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 05:23:57,799 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 05:23:57,799 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 05:23:57,800 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 05:23:57,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 05:23:57,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:23:57 ImpRootNode [2024-12-06 05:23:57,803 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:23:57,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:23:57,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:23:57,804 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:23:57,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:20:09" (3/4) ... [2024-12-06 05:23:57,806 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:23:57,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-12-06 05:23:57,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 05:23:57,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 05:23:57,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 05:23:57,873 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:23:57,873 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:23:57,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:23:57,874 INFO L158 Benchmark]: Toolchain (without parser) took 229100.90ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 116.2MB in the beginning and 378.6MB in the end (delta: -262.4MB). Peak memory consumption was 732.1MB. Max. memory is 16.1GB. [2024-12-06 05:23:57,874 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:23:57,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.34ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 99.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 05:23:57,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.99ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:23:57,875 INFO L158 Benchmark]: Boogie Preprocessor took 21.51ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:23:57,875 INFO L158 Benchmark]: RCFGBuilder took 416.69ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 73.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:23:57,876 INFO L158 Benchmark]: CodeCheck took 228255.28ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 73.2MB in the beginning and 382.8MB in the end (delta: -309.6MB). Peak memory consumption was 690.2MB. Max. memory is 16.1GB. [2024-12-06 05:23:57,876 INFO L158 Benchmark]: Witness Printer took 69.65ms. Allocated memory is still 1.1GB. Free memory was 382.8MB in the beginning and 378.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:23:57,877 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: 218.0s, OverallIterations: 107, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41732 SdHoareTripleChecker+Valid, 104.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39546 mSDsluCounter, 28550 SdHoareTripleChecker+Invalid, 92.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24225 mSDsCounter, 12610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84546 IncrementalHoareTripleChecker+Invalid, 97156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12610 mSolverCounterUnsat, 4325 mSDtfsCounter, 84546 mSolverCounterSat, 1.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19388 GetRequests, 17576 SyntacticMatches, 764 SemanticMatches, 1048 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587696 ImplicationChecksByTransitivity, 206.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 2260 NumberOfCodeBlocks, 2260 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 2154 ConstructedInterpolants, 0 QuantifiedInterpolants, 18936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 97 PerfectInterpolantSequences, 380/414 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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.27ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.34ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 99.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.99ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.51ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 416.69ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 73.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 228255.28ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 73.2MB in the beginning and 382.8MB in the end (delta: -309.6MB). Peak memory consumption was 690.2MB. Max. memory is 16.1GB. * Witness Printer took 69.65ms. Allocated memory is still 1.1GB. Free memory was 382.8MB in the beginning and 378.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - 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-12-06 05:23:57,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4a8567-3b33-4deb-b3bc-e2f6648e4bc1/bin/ukojak-verify-CZk0znPC7b/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