./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:44:12,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:44:12,564 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-12-06 04:44:12,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:44:12,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:44:12,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:44:12,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:44:12,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:44:12,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:44:12,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:44:12,587 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:44:12,588 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:44:12,588 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:44:12,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:44:12,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:44:12,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:44:12,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:44:12,588 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:44:12,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:44:12,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 [2024-12-06 04:44:12,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:44:12,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:44:12,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:44:12,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:44:12,819 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:44:12,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2024-12-06 04:44:15,434 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/data/e3370b86f/79d43f7cdcce4f2ea6e5e25ed81365b1/FLAG99f5a2e46 [2024-12-06 04:44:15,638 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:44:15,639 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2024-12-06 04:44:15,649 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/data/e3370b86f/79d43f7cdcce4f2ea6e5e25ed81365b1/FLAG99f5a2e46 [2024-12-06 04:44:15,995 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/data/e3370b86f/79d43f7cdcce4f2ea6e5e25ed81365b1 [2024-12-06 04:44:15,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:44:15,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:44:15,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:44:15,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:44:16,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:44:16,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:44:15" (1/1) ... [2024-12-06 04:44:16,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2842477b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16, skipping insertion in model container [2024-12-06 04:44:16,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:44:15" (1/1) ... [2024-12-06 04:44:16,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:44:16,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:44:16,263 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:44:16,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:44:16,323 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:44:16,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16 WrapperNode [2024-12-06 04:44:16,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:44:16,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:44:16,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:44:16,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:44:16,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,358 INFO L138 Inliner]: procedures = 111, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2024-12-06 04:44:16,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:44:16,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:44:16,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:44:16,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:44:16,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:44:16,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:44:16,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:44:16,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:44:16,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:44:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:44:16,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:44:16,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:44:16,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 04:44:16,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 04:44:16,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 04:44:16,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 04:44:16,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:44:16,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:44:16,522 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:44:16,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:44:16,758 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-12-06 04:44:16,758 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:44:16,791 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:44:16,791 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 04:44:16,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:44:16 BoogieIcfgContainer [2024-12-06 04:44:16,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:44:16,793 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:44:16,793 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:44:16,800 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:44:16,800 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:44:16" (1/1) ... [2024-12-06 04:44:16,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:44:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 59 states and 63 transitions. [2024-12-06 04:44:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-12-06 04:44:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 04:44:16,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 58 states and 62 transitions. [2024-12-06 04:44:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-12-06 04:44:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 04:44:17,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 57 states and 61 transitions. [2024-12-06 04:44:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-12-06 04:44:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 04:44:17,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 56 states and 60 transitions. [2024-12-06 04:44:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-12-06 04:44:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 04:44:17,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 55 states and 59 transitions. [2024-12-06 04:44:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-12-06 04:44:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 04:44:17,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 54 states and 58 transitions. [2024-12-06 04:44:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-12-06 04:44:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 04:44:18,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 53 states and 57 transitions. [2024-12-06 04:44:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-12-06 04:44:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 04:44:18,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:18,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-12-06 04:44:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 52 states and 56 transitions. [2024-12-06 04:44:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-12-06 04:44:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 04:44:19,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 51 states and 55 transitions. [2024-12-06 04:44:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-12-06 04:44:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:44:20,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 52 states and 57 transitions. [2024-12-06 04:44:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-12-06 04:44:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:44:20,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 53 states and 61 transitions. [2024-12-06 04:44:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-12-06 04:44:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:44:21,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 55 states and 67 transitions. [2024-12-06 04:44:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2024-12-06 04:44:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:44:21,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:21,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 57 states and 72 transitions. [2024-12-06 04:44:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2024-12-06 04:44:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:44:22,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 61 states and 80 transitions. [2024-12-06 04:44:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-12-06 04:44:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:44:23,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 65 states and 87 transitions. [2024-12-06 04:44:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2024-12-06 04:44:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 04:44:23,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 67 states and 93 transitions. [2024-12-06 04:44:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-12-06 04:44:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 04:44:24,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 71 states and 102 transitions. [2024-12-06 04:44:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2024-12-06 04:44:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 04:44:24,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 72 states and 103 transitions. [2024-12-06 04:44:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 103 transitions. [2024-12-06 04:44:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 04:44:24,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:24,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 74 states and 106 transitions. [2024-12-06 04:44:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-12-06 04:44:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 04:44:24,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 76 states and 108 transitions. [2024-12-06 04:44:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2024-12-06 04:44:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:44:25,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 79 states and 114 transitions. [2024-12-06 04:44:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-12-06 04:44:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:44:25,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 82 states and 119 transitions. [2024-12-06 04:44:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-12-06 04:44:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:44:25,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 84 states and 121 transitions. [2024-12-06 04:44:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-12-06 04:44:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:44:25,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 84 states and 120 transitions. [2024-12-06 04:44:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-12-06 04:44:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:44:26,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 91 states and 134 transitions. [2024-12-06 04:44:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2024-12-06 04:44:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:44:26,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 98 states and 148 transitions. [2024-12-06 04:44:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 148 transitions. [2024-12-06 04:44:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:44:27,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 97 states and 147 transitions. [2024-12-06 04:44:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 147 transitions. [2024-12-06 04:44:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:44:27,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 100 states and 151 transitions. [2024-12-06 04:44:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2024-12-06 04:44:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:44:27,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 105 states and 161 transitions. [2024-12-06 04:44:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-12-06 04:44:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:44:28,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 110 states and 170 transitions. [2024-12-06 04:44:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 170 transitions. [2024-12-06 04:44:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:44:28,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 118 states and 189 transitions. [2024-12-06 04:44:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 189 transitions. [2024-12-06 04:44:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:44:31,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 117 states and 188 transitions. [2024-12-06 04:44:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 188 transitions. [2024-12-06 04:44:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:44:31,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 118 states and 188 transitions. [2024-12-06 04:44:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 188 transitions. [2024-12-06 04:44:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:44:31,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 120 states and 191 transitions. [2024-12-06 04:44:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 191 transitions. [2024-12-06 04:44:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:44:31,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 122 states and 193 transitions. [2024-12-06 04:44:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 193 transitions. [2024-12-06 04:44:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:44:31,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 122 states and 192 transitions. [2024-12-06 04:44:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 192 transitions. [2024-12-06 04:44:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:44:32,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 122 states and 191 transitions. [2024-12-06 04:44:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2024-12-06 04:44:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:44:32,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 04:44:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 124 states and 195 transitions. [2024-12-06 04:44:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 195 transitions. [2024-12-06 04:44:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:44:32,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 04:44:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 126 states and 198 transitions. [2024-12-06 04:44:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2024-12-06 04:44:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:44:32,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:32,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-12-06 04:44:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 125 states and 196 transitions. [2024-12-06 04:44:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 196 transitions. [2024-12-06 04:44:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:44:33,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 124 states and 194 transitions. [2024-12-06 04:44:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 194 transitions. [2024-12-06 04:44:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:44:33,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:44:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 127 states and 198 transitions. [2024-12-06 04:44:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 198 transitions. [2024-12-06 04:44:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:44:33,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:44:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 127 states and 197 transitions. [2024-12-06 04:44:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2024-12-06 04:44:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:44:33,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 126 states and 196 transitions. [2024-12-06 04:44:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 196 transitions. [2024-12-06 04:44:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:44:33,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 125 states and 195 transitions. [2024-12-06 04:44:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2024-12-06 04:44:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:44:34,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 04:44:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 125 states and 194 transitions. [2024-12-06 04:44:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 194 transitions. [2024-12-06 04:44:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:44:34,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 04:44:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 135 states and 219 transitions. [2024-12-06 04:44:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 219 transitions. [2024-12-06 04:44:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:44:36,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:36,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:44:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 137 states and 220 transitions. [2024-12-06 04:44:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 220 transitions. [2024-12-06 04:44:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:44:36,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:44:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 139 states and 221 transitions. [2024-12-06 04:44:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 221 transitions. [2024-12-06 04:44:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:44:36,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:44:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 141 states and 223 transitions. [2024-12-06 04:44:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 223 transitions. [2024-12-06 04:44:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:44:36,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:44:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 143 states and 224 transitions. [2024-12-06 04:44:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 224 transitions. [2024-12-06 04:44:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:44:36,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 04:44:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 145 states and 227 transitions. [2024-12-06 04:44:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 227 transitions. [2024-12-06 04:44:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:44:37,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 04:44:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 145 states and 226 transitions. [2024-12-06 04:44:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 226 transitions. [2024-12-06 04:44:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:44:37,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 04:44:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 143 states and 221 transitions. [2024-12-06 04:44:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 221 transitions. [2024-12-06 04:44:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:44:37,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:37,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:44:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 149 states and 228 transitions. [2024-12-06 04:44:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2024-12-06 04:44:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:44:38,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:44:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 155 states and 235 transitions. [2024-12-06 04:44:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 235 transitions. [2024-12-06 04:44:39,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:44:39,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:44:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 166 states and 256 transitions. [2024-12-06 04:44:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2024-12-06 04:44:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:44:41,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:44:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 169 states and 259 transitions. [2024-12-06 04:44:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 259 transitions. [2024-12-06 04:44:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:44:41,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:44:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 172 states and 262 transitions. [2024-12-06 04:44:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2024-12-06 04:44:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:44:41,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 176 states and 269 transitions. [2024-12-06 04:44:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 269 transitions. [2024-12-06 04:44:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:44:46,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:46,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:44:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 180 states and 273 transitions. [2024-12-06 04:44:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2024-12-06 04:44:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:44:47,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:44:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 184 states and 277 transitions. [2024-12-06 04:44:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2024-12-06 04:44:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:44:48,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:44:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 184 states and 276 transitions. [2024-12-06 04:44:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 276 transitions. [2024-12-06 04:44:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:44:48,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:48,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:44:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 184 states and 275 transitions. [2024-12-06 04:44:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 275 transitions. [2024-12-06 04:44:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:44:49,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:44:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 190 states and 288 transitions. [2024-12-06 04:44:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2024-12-06 04:44:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:44:53,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:44:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 193 states and 293 transitions. [2024-12-06 04:44:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 293 transitions. [2024-12-06 04:44:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:44:54,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:44:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 196 states and 296 transitions. [2024-12-06 04:44:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 296 transitions. [2024-12-06 04:44:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:44:54,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:45:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 203 states and 306 transitions. [2024-12-06 04:45:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 306 transitions. [2024-12-06 04:45:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:45:01,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:45:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 210 states and 318 transitions. [2024-12-06 04:45:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 318 transitions. [2024-12-06 04:45:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 04:45:06,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:45:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 212 states and 321 transitions. [2024-12-06 04:45:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2024-12-06 04:45:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 04:45:07,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:45:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 166 states and 250 transitions. [2024-12-06 04:45:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2024-12-06 04:45:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:45:07,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:45:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 171 states and 255 transitions. [2024-12-06 04:45:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2024-12-06 04:45:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:45:10,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:45:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 178 states and 262 transitions. [2024-12-06 04:45:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 262 transitions. [2024-12-06 04:45:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 04:45:16,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 04:45:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 182 states and 266 transitions. [2024-12-06 04:45:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2024-12-06 04:45:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 04:45:20,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:45:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 182 states and 262 transitions. [2024-12-06 04:45:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 262 transitions. [2024-12-06 04:45:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 04:45:22,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:45:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 182 states and 258 transitions. [2024-12-06 04:45:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 258 transitions. [2024-12-06 04:45:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:45:25,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:45:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 50 states and 66 transitions. [2024-12-06 04:45:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-12-06 04:45:26,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 04:45:26,303 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 77 iterations. [2024-12-06 04:45:26,310 INFO L726 CodeCheckObserver]: All specifications hold 35 specifications checked. All of them hold [2024-12-06 04:45:33,589 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,589 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,589 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 569 571) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,591 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_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~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~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) (<= 0 |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-12-06 04:45:33,591 INFO L77 FloydHoareUtils]: At program point L561-1(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|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1) |ULTIMATE.start_test_fun_#t~mem14#1|) (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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,592 INFO L77 FloydHoareUtils]: At program point L561-2(lines 561 564) 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem15#1| 1) |ULTIMATE.start_test_fun_#t~mem14#1|) (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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,592 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,592 INFO L77 FloydHoareUtils]: At program point L561-4(lines 557 566) 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,593 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse22 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse21 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse2 (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.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)) (.cse18 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~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 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse19 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse12 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse13 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse14 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (or (not |ULTIMATE.start_test_fun_#t~short10#1|) (< .cse22 .cse21))) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse17 (= (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|)) (.cse20 (<= 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 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|) .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not .cse19) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20) (and .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 (or |ULTIMATE.start_test_fun_#t~short10#1| (< .cse21 (+ .cse22 1))))))) [2024-12-06 04:45:33,593 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (= (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,593 INFO L77 FloydHoareUtils]: At program point L557-4(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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,593 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,594 INFO L77 FloydHoareUtils]: At program point L557-5(line 557) 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_#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 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse13 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse14 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse15 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse17 (= (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|)) (.cse18 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem8#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse6 .cse7 .cse8 .cse9 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2024-12-06 04:45:33,594 INFO L77 FloydHoareUtils]: At program point L557-7(lines 557 566) 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_#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 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.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)) (.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 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse18 (= (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|)) (.cse19 (<= 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 (< .cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (not |ULTIMATE.start_test_fun_#t~short10#1|) .cse1 .cse2 .cse4 .cse6 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ .cse12 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2024-12-06 04:45:33,594 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,595 INFO L77 FloydHoareUtils]: At program point L557-8(lines 557 566) 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_#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 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1)) (.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 (<= 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 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse18 (= (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|)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2024-12-06 04:45:33,595 INFO L77 FloydHoareUtils]: At program point L557-10(lines 557 566) 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-12-06 04:45:33,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK(lines 569 571) no Hoare annotation was computed. [2024-12-06 04:45:33,595 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 04:45:33,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,596 INFO L77 FloydHoareUtils]: At program point L562(line 562) 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,596 INFO L77 FloydHoareUtils]: At program point L562-1(line 562) 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,596 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,596 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,596 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 (<= 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_#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)) (.cse10 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse9 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1)) (.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 (<= 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 (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse18 (= (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|)) (.cse19 (<= 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_#t~mem11#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (<= .cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2024-12-06 04:45:33,597 INFO L77 FloydHoareUtils]: At program point L558-1(lines 558 565) the Hoare annotation is: (let ((.cse21 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (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_#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)) (.cse10 (+ .cse21 1)) (.cse9 (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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 (<= 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 (= |ULTIMATE.start_test_fun_#t~mem12#1| .cse21)) (.cse16 (<= 0 |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|)) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse10 |ULTIMATE.start_test_fun_#t~mem11#1|) .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2024-12-06 04:45:33,597 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,597 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 04:45:33,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,598 INFO L77 FloydHoareUtils]: At program point L559(line 559) 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,598 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,598 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_#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) (<= (+ |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~y_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) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 0 |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-12-06 04:45:33,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:45:33,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:45:33,606 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:45:33,609 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 04:45:33,609 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:45:33,609 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:45:33,609 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:45:33,610 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:45:33,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:45:33,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:45:33,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 04:45:33,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:45:33,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 04:45:33,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:45:33,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:45:33,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 04:45:33,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:45:33,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 04:45:33,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:45:33,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:45:33,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:45:33,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:45:33 ImpRootNode [2024-12-06 04:45:33,617 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:45:33,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:45:33,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:45:33,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:45:33,619 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:44:16" (3/4) ... [2024-12-06 04:45:33,621 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 04:45:33,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-12-06 04:45:33,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 04:45:33,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 04:45:33,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 04:45:33,690 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:45:33,690 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:45:33,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:45:33,691 INFO L158 Benchmark]: Toolchain (without parser) took 77692.85ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 92.4MB in the beginning and 225.4MB in the end (delta: -133.0MB). Peak memory consumption was 375.0MB. Max. memory is 16.1GB. [2024-12-06 04:45:33,691 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:45:33,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.63ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:45:33,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.53ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 74.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:45:33,692 INFO L158 Benchmark]: Boogie Preprocessor took 22.83ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 73.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:45:33,692 INFO L158 Benchmark]: RCFGBuilder took 409.28ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 52.7MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 04:45:33,693 INFO L158 Benchmark]: CodeCheck took 76824.25ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 52.7MB in the beginning and 229.6MB in the end (delta: -176.9MB). Peak memory consumption was 333.0MB. Max. memory is 16.1GB. [2024-12-06 04:45:33,693 INFO L158 Benchmark]: Witness Printer took 72.81ms. Allocated memory is still 629.1MB. Free memory was 229.6MB in the beginning and 225.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:45:33,694 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, 59 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 69.5s, OverallIterations: 77, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24699 SdHoareTripleChecker+Valid, 66.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23953 mSDsluCounter, 15043 SdHoareTripleChecker+Invalid, 58.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13569 mSDsCounter, 5731 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48263 IncrementalHoareTripleChecker+Invalid, 53994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5731 mSolverCounterUnsat, 1474 mSDtfsCounter, 48263 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10924 GetRequests, 9935 SyntacticMatches, 389 SemanticMatches, 600 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193556 ImplicationChecksByTransitivity, 62.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1218 NumberOfCodeBlocks, 1218 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 10696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 76 PerfectInterpolantSequences, 192/192 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.63ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.53ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 74.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.83ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 73.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 409.28ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 52.7MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 76824.25ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 52.7MB in the beginning and 229.6MB in the end (delta: -176.9MB). Peak memory consumption was 333.0MB. Max. memory is 16.1GB. * Witness Printer took 72.81ms. Allocated memory is still 629.1MB. Free memory was 229.6MB in the beginning and 225.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: 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: #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: ~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: #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: #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: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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] RESULT: Ultimate proved your program to be correct! [2024-12-06 04:45:33,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b165c6-91b8-4bf8-993a-c5de0ed5e5b6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE