./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:28:50,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:28:50,244 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-08 19:28:50,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:28:50,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:28:50,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:28:50,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:28:50,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:28:50,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:28:50,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:28:50,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:28:50,283 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:28:50,284 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:28:50,284 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:28:50,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:28:50,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:28:50,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:28:50,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:28:50,290 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:28:50,290 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:28:50,291 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:28:50,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:28:50,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:28:50,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:28:50,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:28:50,295 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:28:50,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:28:50,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a [2024-11-08 19:28:50,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:28:50,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:28:50,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:28:50,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:28:50,643 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:28:50,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i Unable to find full path for "g++" [2024-11-08 19:28:52,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:28:52,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:28:52,931 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2024-11-08 19:28:52,944 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/data/9a8452abe/1716af15d011471e9ee43427ddfe2f61/FLAGf83f4adac [2024-11-08 19:28:52,960 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/data/9a8452abe/1716af15d011471e9ee43427ddfe2f61 [2024-11-08 19:28:52,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:28:52,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:28:52,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:28:52,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:28:52,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:28:52,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:28:52" (1/1) ... [2024-11-08 19:28:52,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70241fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:52, skipping insertion in model container [2024-11-08 19:28:52,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:28:52" (1/1) ... [2024-11-08 19:28:53,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:28:53,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:28:53,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:28:53,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:28:53,418 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:28:53,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53 WrapperNode [2024-11-08 19:28:53,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:28:53,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:28:53,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:28:53,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:28:53,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,473 INFO L138 Inliner]: procedures = 111, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-08 19:28:53,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:28:53,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:28:53,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:28:53,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:28:53,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:28:53,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:28:53,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:28:53,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:28:53,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:53" (1/1) ... [2024-11-08 19:28:53,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:28:53,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:28:53,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:28:53,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:28:53,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:28:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:28:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:28:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:28:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:28:53,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:28:53,694 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:28:53,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:28:53,956 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-08 19:28:53,956 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:28:54,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:28:54,049 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:28:54,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:28:54 BoogieIcfgContainer [2024-11-08 19:28:54,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:28:54,055 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:28:54,055 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:28:54,067 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:28:54,067 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:28:54" (1/1) ... [2024-11-08 19:28:54,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:28:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 49 states and 52 transitions. [2024-11-08 19:28:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-08 19:28:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 19:28:54,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 48 states and 51 transitions. [2024-11-08 19:28:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2024-11-08 19:28:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 19:28:54,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 47 states and 50 transitions. [2024-11-08 19:28:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-08 19:28:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 19:28:55,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:55,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 46 states and 49 transitions. [2024-11-08 19:28:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-08 19:28:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 19:28:55,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 45 states and 48 transitions. [2024-11-08 19:28:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-08 19:28:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 19:28:55,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 44 states and 47 transitions. [2024-11-08 19:28:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-08 19:28:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 19:28:56,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 43 states and 46 transitions. [2024-11-08 19:28:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-08 19:28:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:28:56,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-08 19:28:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-08 19:28:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:28:57,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2024-11-08 19:28:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-08 19:28:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 19:28:58,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-08 19:28:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-08 19:28:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 19:28:59,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:59,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 43 states and 48 transitions. [2024-11-08 19:29:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-08 19:29:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:29:00,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:00,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 45 states and 53 transitions. [2024-11-08 19:29:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-11-08 19:29:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:29:01,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 47 states and 58 transitions. [2024-11-08 19:29:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-08 19:29:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:29:02,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 51 states and 66 transitions. [2024-11-08 19:29:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-08 19:29:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:29:02,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 55 states and 73 transitions. [2024-11-08 19:29:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-11-08 19:29:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:29:04,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 60 states and 87 transitions. [2024-11-08 19:29:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-08 19:29:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:29:04,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 65 states and 101 transitions. [2024-11-08 19:29:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2024-11-08 19:29:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:29:06,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:06,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 66 states and 102 transitions. [2024-11-08 19:29:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-11-08 19:29:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:29:06,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 72 states and 117 transitions. [2024-11-08 19:29:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2024-11-08 19:29:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:29:10,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 73 states and 119 transitions. [2024-11-08 19:29:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 119 transitions. [2024-11-08 19:29:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:29:10,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 77 states and 132 transitions. [2024-11-08 19:29:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 132 transitions. [2024-11-08 19:29:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:29:12,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 78 states and 132 transitions. [2024-11-08 19:29:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 132 transitions. [2024-11-08 19:29:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:29:12,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:12,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 83 states and 144 transitions. [2024-11-08 19:29:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 144 transitions. [2024-11-08 19:29:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:29:14,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 87 states and 153 transitions. [2024-11-08 19:29:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 153 transitions. [2024-11-08 19:29:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:29:18,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 89 states and 158 transitions. [2024-11-08 19:29:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 158 transitions. [2024-11-08 19:29:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:29:18,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:18,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-11-08 19:29:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 96 states and 174 transitions. [2024-11-08 19:29:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 174 transitions. [2024-11-08 19:29:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:29:22,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 98 states and 178 transitions. [2024-11-08 19:29:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 178 transitions. [2024-11-08 19:29:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:29:22,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 101 states and 183 transitions. [2024-11-08 19:29:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 183 transitions. [2024-11-08 19:29:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:29:23,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 102 states and 186 transitions. [2024-11-08 19:29:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 186 transitions. [2024-11-08 19:29:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:29:23,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 104 states and 191 transitions. [2024-11-08 19:29:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 191 transitions. [2024-11-08 19:29:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:29:23,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 103 states and 190 transitions. [2024-11-08 19:29:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2024-11-08 19:29:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:29:23,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 104 states and 190 transitions. [2024-11-08 19:29:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 190 transitions. [2024-11-08 19:29:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:29:23,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 103 states and 189 transitions. [2024-11-08 19:29:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2024-11-08 19:29:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:29:23,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 104 states and 197 transitions. [2024-11-08 19:29:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2024-11-08 19:29:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:29:23,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:29:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 106 states and 198 transitions. [2024-11-08 19:29:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 198 transitions. [2024-11-08 19:29:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:29:23,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:29:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 108 states and 199 transitions. [2024-11-08 19:29:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 199 transitions. [2024-11-08 19:29:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:29:23,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:29:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 114 states and 209 transitions. [2024-11-08 19:29:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 209 transitions. [2024-11-08 19:29:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:29:25,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:25,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:29:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 122 states and 223 transitions. [2024-11-08 19:29:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 223 transitions. [2024-11-08 19:29:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:29:26,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:29:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 124 states and 226 transitions. [2024-11-08 19:29:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 226 transitions. [2024-11-08 19:29:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:29:27,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:29:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 126 states and 227 transitions. [2024-11-08 19:29:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 227 transitions. [2024-11-08 19:29:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 19:29:27,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:27,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 125 states and 225 transitions. [2024-11-08 19:29:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 225 transitions. [2024-11-08 19:29:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 19:29:27,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 127 states and 227 transitions. [2024-11-08 19:29:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 227 transitions. [2024-11-08 19:29:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:29:27,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 132 states and 235 transitions. [2024-11-08 19:29:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 235 transitions. [2024-11-08 19:29:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:29:28,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 137 states and 241 transitions. [2024-11-08 19:29:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 241 transitions. [2024-11-08 19:29:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:29:29,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 139 states and 243 transitions. [2024-11-08 19:29:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 243 transitions. [2024-11-08 19:29:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:29:29,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:29,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 141 states and 244 transitions. [2024-11-08 19:29:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 244 transitions. [2024-11-08 19:29:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:29:30,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 147 states and 253 transitions. [2024-11-08 19:29:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 253 transitions. [2024-11-08 19:29:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:29:36,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:36,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 160 states and 281 transitions. [2024-11-08 19:29:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 281 transitions. [2024-11-08 19:29:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:29:51,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:29:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 161 states and 282 transitions. [2024-11-08 19:29:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 282 transitions. [2024-11-08 19:29:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:29:53,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:29:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 163 states and 284 transitions. [2024-11-08 19:29:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2024-11-08 19:29:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:29:55,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 170 states and 304 transitions. [2024-11-08 19:30:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 304 transitions. [2024-11-08 19:30:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:30:06,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:30:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 172 states and 308 transitions. [2024-11-08 19:30:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 308 transitions. [2024-11-08 19:30:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:30:08,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 182 states and 326 transitions. [2024-11-08 19:30:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 326 transitions. [2024-11-08 19:30:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:30:32,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:32,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 19:30:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 177 states and 317 transitions. [2024-11-08 19:30:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 317 transitions. [2024-11-08 19:30:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:30:33,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 19:30:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 178 states and 317 transitions. [2024-11-08 19:30:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 317 transitions. [2024-11-08 19:30:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:30:33,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 19:30:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 176 states and 314 transitions. [2024-11-08 19:30:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 314 transitions. [2024-11-08 19:30:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:30:33,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 19:30:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 175 states and 313 transitions. [2024-11-08 19:30:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 313 transitions. [2024-11-08 19:30:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:30:34,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:34,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:30:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 177 states and 315 transitions. [2024-11-08 19:30:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 315 transitions. [2024-11-08 19:30:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:30:35,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:30:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 177 states and 314 transitions. [2024-11-08 19:30:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 314 transitions. [2024-11-08 19:30:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:35,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:30:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 181 states and 321 transitions. [2024-11-08 19:30:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 321 transitions. [2024-11-08 19:30:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:38,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:38,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:30:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 187 states and 332 transitions. [2024-11-08 19:30:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 332 transitions. [2024-11-08 19:30:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:40,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:30:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 189 states and 335 transitions. [2024-11-08 19:30:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2024-11-08 19:30:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:41,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:30:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 191 states and 341 transitions. [2024-11-08 19:30:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 341 transitions. [2024-11-08 19:30:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:43,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:30:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 192 states and 343 transitions. [2024-11-08 19:30:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 343 transitions. [2024-11-08 19:30:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:45,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:30:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 194 states and 344 transitions. [2024-11-08 19:30:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 344 transitions. [2024-11-08 19:30:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:46,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:30:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 195 states and 344 transitions. [2024-11-08 19:30:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 344 transitions. [2024-11-08 19:30:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:30:47,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:30:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 195 states and 343 transitions. [2024-11-08 19:30:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 343 transitions. [2024-11-08 19:30:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:30:48,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 19:30:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 198 states and 347 transitions. [2024-11-08 19:30:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 347 transitions. [2024-11-08 19:30:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:30:49,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 19:30:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 201 states and 350 transitions. [2024-11-08 19:30:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 350 transitions. [2024-11-08 19:30:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:30:50,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:30:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 203 states and 351 transitions. [2024-11-08 19:30:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 351 transitions. [2024-11-08 19:30:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:30:51,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:30:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 205 states and 352 transitions. [2024-11-08 19:30:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 352 transitions. [2024-11-08 19:30:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:30:51,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:31:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 209 states and 357 transitions. [2024-11-08 19:31:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 357 transitions. [2024-11-08 19:31:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:31:01,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 221 states and 385 transitions. [2024-11-08 19:31:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 385 transitions. [2024-11-08 19:31:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:31:20,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 230 states and 408 transitions. [2024-11-08 19:31:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 408 transitions. [2024-11-08 19:31:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:31:36,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:31:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 235 states and 418 transitions. [2024-11-08 19:31:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 418 transitions. [2024-11-08 19:31:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:31:50,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:31:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 240 states and 423 transitions. [2024-11-08 19:31:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 423 transitions. [2024-11-08 19:31:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:31:59,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 243 states and 426 transitions. [2024-11-08 19:32:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 426 transitions. [2024-11-08 19:32:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:32:05,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:32:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 247 states and 431 transitions. [2024-11-08 19:32:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 431 transitions. [2024-11-08 19:32:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:32:19,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:32:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 250 states and 435 transitions. [2024-11-08 19:32:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2024-11-08 19:32:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:32:24,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:32:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 253 states and 439 transitions. [2024-11-08 19:32:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 439 transitions. [2024-11-08 19:32:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:32:27,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 264 states and 469 transitions. [2024-11-08 19:33:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 469 transitions. [2024-11-08 19:33:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:33:12,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 19:33:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 265 states and 471 transitions. [2024-11-08 19:33:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 471 transitions. [2024-11-08 19:33:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:33:15,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 19:33:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 266 states and 471 transitions. [2024-11-08 19:33:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 471 transitions. [2024-11-08 19:33:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 19:33:17,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:17,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:33:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 269 states and 477 transitions. [2024-11-08 19:33:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 477 transitions. [2024-11-08 19:33:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 19:33:23,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:23,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-08 19:33:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 270 states and 479 transitions. [2024-11-08 19:33:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 479 transitions. [2024-11-08 19:33:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 19:33:26,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 19:33:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 272 states and 484 transitions. [2024-11-08 19:33:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 484 transitions. [2024-11-08 19:33:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 19:33:28,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 19:33:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 36 states and 45 transitions. [2024-11-08 19:33:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-08 19:33:32,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:33:32,670 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 87 iterations. [2024-11-08 19:33:32,681 INFO L729 CodeCheckObserver]: All specifications hold 29 specifications checked. All of them hold [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,226 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,227 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 566 568) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 19:33:43,227 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,227 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,227 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,227 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,227 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,227 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,231 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:33:43,233 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (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|))) (.cse20 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse4 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse7 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse16 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse19 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 4 .cse20) .cse21) (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse3 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) .cse20) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_test_fun_#t~mem13#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21))) [2024-11-08 19:33:43,234 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,234 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:33:43,234 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse23 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse10 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse15 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse16 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse18 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse0 (not |ULTIMATE.start_test_fun_#t~short9#1|)) (.cse11 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse20 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse21 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse22 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse24 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (and (or .cse0 (< .cse1 .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 4 .cse23) .cse24) (let ((.cse25 (+ .cse1 1))) (and (or .cse11 (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse25)) .cse3 .cse4 .cse5 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse6 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) .cse23) .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 (not .cse13) .cse17 .cse18 .cse19 (or .cse0 (and .cse11 (<= .cse25 .cse2))) .cse20 .cse21 .cse22 .cse24)))) [2024-11-08 19:33:43,235 INFO L77 FloydHoareUtils]: At program point L557-3(line 557) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:33:43,235 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~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 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-08 19:33:43,235 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~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 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-08 19:33:43,236 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK(lines 566 568) no Hoare annotation was computed. [2024-11-08 19:33:43,236 INFO L77 FloydHoareUtils]: At program point L557-6(lines 557 563) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= (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|))) (.cse12 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse14 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse15 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse16 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse18 (= |ULTIMATE.start_test_fun_~z_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)) (.cse17 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse20 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse22 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse8 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse11 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short9#1|) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse2 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) .cse11) .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse4 .cse5 .cse17 (not .cse18) .cse19 .cse20 .cse21 .cse22 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483647) .cse18 .cse4 .cse5 .cse17 .cse19 .cse20 .cse21 .cse22 .cse6 .cse7 .cse8 (<= 4 .cse11) .cse9))) [2024-11-08 19:33:43,236 INFO L77 FloydHoareUtils]: At program point L557-8(lines 557 563) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:33:43,238 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 19:33:43,238 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,238 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,238 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,238 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,238 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,239 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,239 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (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|))) (.cse5 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse18 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse20 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse21 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse22 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse3 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483646) .cse18 .cse19 .cse20 .cse21 (<= 4 .cse4) .cse22))) [2024-11-08 19:33:43,240 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (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|))) (.cse5 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse18 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse20 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse21 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse22 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse3 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483646) .cse18 .cse19 .cse20 .cse21 (<= 4 .cse4) .cse22))) [2024-11-08 19:33:43,240 INFO L77 FloydHoareUtils]: At program point L558-2(lines 558 562) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (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|))) (.cse22 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse4 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse7 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse10 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse15 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse18 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse20 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse21 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse23 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse17 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse17 2147483646) .cse18 .cse19 .cse20 .cse21 (<= 4 .cse22) .cse23) (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse3 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) .cse22) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 (not .cse10) .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 (= |ULTIMATE.start_test_fun_#t~mem11#1| .cse17)))) [2024-11-08 19:33:43,240 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~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 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-08 19:33:43,240 INFO L77 FloydHoareUtils]: At program point L558-4(lines 557 563) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:33:43,241 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 19:33:43,241 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,241 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,244 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,244 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,244 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,244 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,245 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse9 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse13 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse20 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< 2147483646 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2024-11-08 19:33:43,245 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse9 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse13 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse20 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< 2147483646 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2024-11-08 19:33:43,245 INFO L77 FloydHoareUtils]: At program point L555(line 555) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~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 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-08 19:33:43,245 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:33:43,260 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:33:43,261 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:33:43,262 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:33:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:33:43,264 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:33:43,264 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:33:43,264 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:33:43,264 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:33:43,265 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 19:33:43,266 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:33:43,266 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:33:43,266 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:33:43,266 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:33:43,266 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:33:43,268 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:33:43,268 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:33:43,269 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:33:43,269 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:33:43,269 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:33:43,269 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:33:43,269 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-11-08 19:33:43,270 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:33:43,270 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:33:43,270 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-11-08 19:33:43,270 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:33:43,270 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:33:43,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-11-08 19:33:43,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-11-08 19:33:43,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:33:43,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:33:43,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:33:43,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:33:43,272 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-08 19:33:43,272 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-11-08 19:33:43,272 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-08 19:33:43,272 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-11-08 19:33:43,273 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-08 19:33:43,273 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:33:43,273 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:33:43,273 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 19:33:43,274 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-08 19:33:43,274 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:33:43,274 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:33:43,274 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:33:43,275 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:33:43,275 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:33:43,275 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:33:43,275 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:33:43,275 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:33:43,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:33:43,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:33:43,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 19:33:43,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:33:43,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:33:43,277 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:33:43,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:33:43 ImpRootNode [2024-11-08 19:33:43,279 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:33:43,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:33:43,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:33:43,280 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:33:43,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:28:54" (3/4) ... [2024-11-08 19:33:43,284 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:33:43,294 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-08 19:33:43,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 19:33:43,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 19:33:43,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 19:33:43,410 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:33:43,411 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 19:33:43,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:33:43,412 INFO L158 Benchmark]: Toolchain (without parser) took 290448.43ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 116.2MB in the beginning and 996.7MB in the end (delta: -880.5MB). Peak memory consumption was 843.5MB. Max. memory is 16.1GB. [2024-11-08 19:33:43,413 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:43,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.85ms. Allocated memory is still 159.4MB. Free memory was 115.7MB in the beginning and 97.4MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:33:43,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.43ms. Allocated memory is still 159.4MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:33:43,415 INFO L158 Benchmark]: Boogie Preprocessor took 39.37ms. Allocated memory is still 159.4MB. Free memory was 95.8MB in the beginning and 94.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:43,416 INFO L158 Benchmark]: RCFGBuilder took 536.05ms. Allocated memory is still 159.4MB. Free memory was 94.4MB in the beginning and 73.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 19:33:43,416 INFO L158 Benchmark]: CodeCheck took 289224.53ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 73.4MB in the beginning and 1.0GB in the end (delta: -928.6MB). Peak memory consumption was 795.3MB. Max. memory is 16.1GB. [2024-11-08 19:33:43,417 INFO L158 Benchmark]: Witness Printer took 131.75ms. Allocated memory is still 1.9GB. Free memory was 1.0GB in the beginning and 996.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:33:43,419 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, 49 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 278.6s, OverallIterations: 87, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34823 SdHoareTripleChecker+Valid, 152.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33869 mSDsluCounter, 15393 SdHoareTripleChecker+Invalid, 136.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13685 mSDsCounter, 7243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78083 IncrementalHoareTripleChecker+Invalid, 85326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7243 mSolverCounterUnsat, 1708 mSDtfsCounter, 78083 mSolverCounterSat, 2.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16556 GetRequests, 14727 SyntacticMatches, 789 SemanticMatches, 1040 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635259 ImplicationChecksByTransitivity, 256.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 43.3s InterpolantComputationTime, 1711 NumberOfCodeBlocks, 1711 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 1625 ConstructedInterpolants, 0 QuantifiedInterpolants, 26531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 86 InterpolantComputations, 69 PerfectInterpolantSequences, 537/691 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.85ms. Allocated memory is still 159.4MB. Free memory was 115.7MB in the beginning and 97.4MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.43ms. Allocated memory is still 159.4MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.37ms. Allocated memory is still 159.4MB. Free memory was 95.8MB in the beginning and 94.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 536.05ms. Allocated memory is still 159.4MB. Free memory was 94.4MB in the beginning and 73.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * CodeCheck took 289224.53ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 73.4MB in the beginning and 1.0GB in the end (delta: -928.6MB). Peak memory consumption was 795.3MB. Max. memory is 16.1GB. * Witness Printer took 131.75ms. Allocated memory is still 1.9GB. Free memory was 1.0GB in the beginning and 996.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_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: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!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: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-11-08 19:33:43,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3af5ad7f-f069-45ed-9d4a-0c227b3ece5c/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE