./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/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_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/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 32bit --witnessprinter.graph.data.programhash 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:48:00,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:48:00,967 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-12-05 23:48:00,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:48:00,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:48:00,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:48:00,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:48:00,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:48:00,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:48:00,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:48:00,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:48:00,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:48:00,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:48:00,991 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-05 23:48:00,991 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:48:00,992 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:48:00,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:48:00,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:48:00,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:48:00,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:48:00,993 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:48:00,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:48:00,993 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_f0411988-375c-4b76-ba4b-7930b350a0d2/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 [2024-12-05 23:48:01,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:48:01,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:48:01,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:48:01,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:48:01,225 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:48:01,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2024-12-05 23:48:03,863 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/data/7c9d4d634/0c5f6bb569994e5c90a5dc78f29c3038/FLAGaeabaff10 [2024-12-05 23:48:04,113 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:48:04,113 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2024-12-05 23:48:04,126 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/data/7c9d4d634/0c5f6bb569994e5c90a5dc78f29c3038/FLAGaeabaff10 [2024-12-05 23:48:04,428 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/data/7c9d4d634/0c5f6bb569994e5c90a5dc78f29c3038 [2024-12-05 23:48:04,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:48:04,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:48:04,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:48:04,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:48:04,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:48:04,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1750b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04, skipping insertion in model container [2024-12-05 23:48:04,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:48:04,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:48:04,775 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:48:04,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:48:04,862 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:48:04,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04 WrapperNode [2024-12-05 23:48:04,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:48:04,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:48:04,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:48:04,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:48:04,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,897 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 33, calls inlined = 10, statements flattened = 90 [2024-12-05 23:48:04,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:48:04,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:48:04,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:48:04,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:48:04,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:48:04,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:48:04,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:48:04,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:48:04,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:48:04" (1/1) ... [2024-12-05 23:48:04,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:48:04,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:48:04,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:48:04,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:48:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-05 23:48:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:48:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-05 23:48:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-12-05 23:48:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-12-05 23:48:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 23:48:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-12-05 23:48:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:48:04,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:48:05,080 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:48:05,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:48:05,304 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-12-05 23:48:05,304 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:48:05,353 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:48:05,354 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-05 23:48:05,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:48:05 BoogieIcfgContainer [2024-12-05 23:48:05,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:48:05,355 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:48:05,355 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:48:05,361 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:48:05,361 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:48:05" (1/1) ... [2024-12-05 23:48:05,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:48:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 49 states and 50 transitions. [2024-12-05 23:48:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2024-12-05 23:48:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 23:48:05,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:05,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-05 23:48:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 48 states and 49 transitions. [2024-12-05 23:48:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-12-05 23:48:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 23:48:05,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:05,967 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-05 23:48:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 47 states and 48 transitions. [2024-12-05 23:48:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-12-05 23:48:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 23:48:06,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:06,364 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-05 23:48:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 49 states and 51 transitions. [2024-12-05 23:48:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-12-05 23:48:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 23:48:06,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:06,769 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-05 23:48:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 51 states and 54 transitions. [2024-12-05 23:48:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-12-05 23:48:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 23:48:07,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:07,494 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-05 23:48:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 50 states and 53 transitions. [2024-12-05 23:48:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-12-05 23:48:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 23:48:08,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:08,398 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-05 23:48:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 49 states and 52 transitions. [2024-12-05 23:48:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-12-05 23:48:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 23:48:09,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:09,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 52 states and 58 transitions. [2024-12-05 23:48:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-12-05 23:48:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 23:48:10,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:11,090 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-05 23:48:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 55 states and 64 transitions. [2024-12-05 23:48:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-12-05 23:48:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 23:48:13,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:13,394 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-05 23:48:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 54 states and 63 transitions. [2024-12-05 23:48:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-12-05 23:48:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 23:48:14,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 53 states and 62 transitions. [2024-12-05 23:48:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-12-05 23:48:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 23:48:17,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 52 states and 61 transitions. [2024-12-05 23:48:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-12-05 23:48:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 23:48:17,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:18,091 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-05 23:48:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 51 states and 60 transitions. [2024-12-05 23:48:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-12-05 23:48:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:48:18,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 56 states and 70 transitions. [2024-12-05 23:48:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-12-05 23:48:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:48:21,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:21,863 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-05 23:48:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 58 states and 75 transitions. [2024-12-05 23:48:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2024-12-05 23:48:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:48:22,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:23,102 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-05 23:48:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 60 states and 79 transitions. [2024-12-05 23:48:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-12-05 23:48:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:48:24,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:48:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 59 states and 78 transitions. [2024-12-05 23:48:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-12-05 23:48:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:48:26,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:27,320 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-05 23:48:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 58 states and 77 transitions. [2024-12-05 23:48:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-12-05 23:48:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 23:48:32,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:32,729 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-05 23:48:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 55 states and 73 transitions. [2024-12-05 23:48:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-12-05 23:48:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 23:48:37,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:38,434 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-05 23:48:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 54 states and 72 transitions. [2024-12-05 23:48:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-12-05 23:48:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 23:48:45,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:46,807 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-05 23:48:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 52 states and 68 transitions. [2024-12-05 23:48:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2024-12-05 23:48:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 23:48:52,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:52,759 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-05 23:48:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 51 states and 63 transitions. [2024-12-05 23:48:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2024-12-05 23:48:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 23:48:54,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:55,085 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-05 23:48:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 51 states and 62 transitions. [2024-12-05 23:48:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-12-05 23:48:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 23:48:58,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:58,328 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-05 23:48:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 48 states and 59 transitions. [2024-12-05 23:48:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-12-05 23:48:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:48:59,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:01,371 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-05 23:49:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 48 states and 61 transitions. [2024-12-05 23:49:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2024-12-05 23:49:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:49:10,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:10,537 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-05 23:49:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 50 states and 66 transitions. [2024-12-05 23:49:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-12-05 23:49:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:49:12,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:12,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:12,031 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-05 23:49:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 51 states and 67 transitions. [2024-12-05 23:49:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-12-05 23:49:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:49:12,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:49:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 52 states and 68 transitions. [2024-12-05 23:49:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2024-12-05 23:49:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:49:13,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:13,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:13,650 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-05 23:49:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 52 states and 67 transitions. [2024-12-05 23:49:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-12-05 23:49:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:49:15,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:15,708 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-05 23:49:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 51 states and 64 transitions. [2024-12-05 23:49:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2024-12-05 23:49:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 23:49:17,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:17,959 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-05 23:49:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 50 states and 63 transitions. [2024-12-05 23:49:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-12-05 23:49:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 23:49:17,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:49:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 51 states and 64 transitions. [2024-12-05 23:49:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2024-12-05 23:49:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:49:18,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:21,891 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-05 23:49:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 56 states and 75 transitions. [2024-12-05 23:49:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-12-05 23:49:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:49:35,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:38,451 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-05 23:49:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 58 states and 79 transitions. [2024-12-05 23:49:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-12-05 23:49:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:49:49,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:49,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:49,946 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-05 23:49:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 58 states and 78 transitions. [2024-12-05 23:49:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-12-05 23:49:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:49:54,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:54,515 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-05 23:49:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:49:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 59 states and 79 transitions. [2024-12-05 23:49:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-12-05 23:49:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 23:49:55,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:49:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:49:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:49:59,189 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-05 23:50:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 64 states and 90 transitions. [2024-12-05 23:50:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-12-05 23:50:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 23:50:13,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 69 states and 102 transitions. [2024-12-05 23:50:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2024-12-05 23:50:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 23:50:33,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:33,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:50:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 70 states and 103 transitions. [2024-12-05 23:50:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2024-12-05 23:50:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 23:50:36,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:36,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:36,346 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-05 23:50:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 71 states and 104 transitions. [2024-12-05 23:50:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2024-12-05 23:50:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 23:50:38,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:40,295 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-05 23:50:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:50:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 74 states and 110 transitions. [2024-12-05 23:50:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-12-05 23:50:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-05 23:50:48,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:50:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:50:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:50:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 81 states and 123 transitions. [2024-12-05 23:51:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-12-05 23:51:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-05 23:51:15,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:15,793 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-05 23:51:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 82 states and 124 transitions. [2024-12-05 23:51:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-12-05 23:51:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-05 23:51:18,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:51:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 87 states and 133 transitions. [2024-12-05 23:51:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-12-05 23:51:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-05 23:51:27,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:51:33,193 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-05 23:51:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:51:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 96 states and 171 transitions. [2024-12-05 23:51:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 171 transitions. [2024-12-05 23:51:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-05 23:51:54,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:51:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:51:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:00,257 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-05 23:52:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 103 states and 187 transitions. [2024-12-05 23:52:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2024-12-05 23:52:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-05 23:52:23,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:30,112 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-05 23:52:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 104 states and 189 transitions. [2024-12-05 23:52:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 189 transitions. [2024-12-05 23:52:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 23:52:39,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:52:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:52:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 104 states and 187 transitions. [2024-12-05 23:52:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 187 transitions. [2024-12-05 23:52:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 23:52:42,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:52:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:52:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:52:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 113 states and 217 transitions. [2024-12-05 23:53:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 217 transitions. [2024-12-05 23:53:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 23:53:39,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:39,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 114 states and 217 transitions. [2024-12-05 23:53:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 217 transitions. [2024-12-05 23:53:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 23:53:50,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:53:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:53:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:53:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 115 states and 218 transitions. [2024-12-05 23:53:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 218 transitions. [2024-12-05 23:53:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 23:53:52,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:53:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:53:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:54:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:54:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:54:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-12-05 23:54:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-12-05 23:54:43,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 23:54:43,705 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 52 iterations. [2024-12-05 23:54:43,710 INFO L726 CodeCheckObserver]: All specifications hold 28 specifications checked. All of them hold [2024-12-05 23:54:48,573 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,574 INFO L77 FloydHoareUtils]: At program point L770-2(line 770) the Hoare annotation is: (let ((.cse1 (<= (+ |ULTIMATE.start_free_14_~p~1#1.offset| 12) (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|))) (.cse2 (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1)) (.cse3 (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (.cse0 (+ |ULTIMATE.start_free_14_~p~1#1.offset| 4))) (or (and (= |ULTIMATE.start_free_14_~plist#1.offset| .cse0) .cse1 .cse2 (= .cse3 |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= 0 .cse0)) (let ((.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~p~1#1.base|)) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~p~1#1.base|))) (let ((.cse6 (select .cse8 8)) (.cse4 (select .cse8 .cse0)) (.cse5 (select .cse7 .cse0))) (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| .cse4) 1) (= |ULTIMATE.start_free_14_~p~1#1.offset| 0) .cse1 (<= .cse5 |ULTIMATE.start_free_14_~plist#1.offset|) (= .cse4 |ULTIMATE.start_free_14_~plist#1.base|) (= (select |#length| .cse6) 8) .cse2 (= (select |#valid| .cse6) 1) (= (select |#length| .cse4) 8) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (= 0 (select .cse7 8)) (= .cse5 0) (= (store .cse3 |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)))))) [2024-12-05 23:54:48,574 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,574 INFO L77 FloydHoareUtils]: At program point L770-7(line 770) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_14_~n~1#1.base|) 1) (= |ULTIMATE.start_free_14_~plist#1.offset| (+ |ULTIMATE.start_free_14_~p~1#1.offset| 4)) (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_free_14_~n~1#1.base|) (<= (+ |ULTIMATE.start_free_14_~p~1#1.offset| 12) (select |#length| |ULTIMATE.start_free_14_~n~1#1.base|)) (= (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= |ULTIMATE.start_free_14_~n~1#1.offset| |ULTIMATE.start_free_14_~p~1#1.offset|) (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= 0 (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4))) [2024-12-05 23:54:48,575 INFO L77 FloydHoareUtils]: At program point L770-9(lines 770 773) the Hoare annotation is: (let ((.cse7 (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1)) (.cse2 (= .cse7 |ULTIMATE.start_main_old_#valid#1|)) (.cse0 (+ |ULTIMATE.start_free_14_~p~1#1.offset| 4))) (or (and (= |ULTIMATE.start_free_14_~plist#1.offset| .cse0) .cse1 .cse2 (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|)) (let ((.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~p~1#1.base|)) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~p~1#1.base|))) (let ((.cse5 (select .cse8 8)) (.cse4 (select .cse6 .cse0)) (.cse3 (select .cse8 .cse0))) (and (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| .cse3) 1) (= |ULTIMATE.start_free_14_~p~1#1.offset| 0) (= (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4) .cse4) (<= (+ |ULTIMATE.start_free_14_~p~1#1.offset| 12) (select |#length| |ULTIMATE.start_free_14_~p~1#1.base|)) (<= .cse4 |ULTIMATE.start_free_14_~plist#1.offset|) (= .cse3 |ULTIMATE.start_free_14_~plist#1.base|) (= (select |#length| .cse5) 8) .cse1 (= (select |#valid| .cse5) 1) (= (select |#length| .cse3) 8) (not .cse2) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (= 0 (select .cse6 8)) (= .cse4 0) (= (store .cse7 |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_14_~n~1#1.base| .cse3))))))) [2024-12-05 23:54:48,575 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,575 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,575 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,575 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,575 INFO L77 FloydHoareUtils]: At program point L548(line 548) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|) |ULTIMATE.start___ldv_list_add_~new#1.offset|))) (and (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~prev#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|) 12) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| 0) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (= 8 (select |#length| .cse0)) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| .cse0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start___ldv_list_add_~new#1.base|) |ULTIMATE.start___ldv_list_add_~new#1.offset|)))) [2024-12-05 23:54:48,575 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,576 INFO L77 FloydHoareUtils]: At program point L763(lines 763 765) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_alloc_14_~p~0#1.base| 0)) (.cse3 (= |ULTIMATE.start_alloc_14_~p~0#1.offset| 0))) (let ((.cse2 (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (.cse0 (and .cse1 .cse3))) (and (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| |ULTIMATE.start_alloc_14_~list#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|) |ULTIMATE.start_entry_point_~#list_14~0#1.offset|) (<= (+ |ULTIMATE.start_alloc_14_~p~0#1.base| 1) |#StackHeapBarrier|) (or (= (select |#valid| |ULTIMATE.start_alloc_14_~p~0#1.base|) 1) .cse0) (= 8 (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (or (not .cse1) (= .cse2 |ULTIMATE.start_main_old_#valid#1|)) (or .cse0 (and (= 12 (select |#length| |ULTIMATE.start_alloc_14_~p~0#1.base|)) .cse3)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| 0) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (= |ULTIMATE.start_alloc_14_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) 1) (or (= (store .cse2 |ULTIMATE.start_alloc_14_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) 0) |ULTIMATE.start_entry_point_~#list_14~0#1.base|)))) [2024-12-05 23:54:48,576 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,576 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,576 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,576 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,576 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,576 INFO L77 FloydHoareUtils]: At program point L780(lines 780 782) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-05 23:54:48,576 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 772) no Hoare annotation was computed. [2024-12-05 23:54:48,576 INFO L77 FloydHoareUtils]: At program point L549(line 549) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|))) (let ((.cse2 (select .cse0 |ULTIMATE.start___ldv_list_add_~new#1.offset|)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start___ldv_list_add_~new#1.base|))) (and (= |ULTIMATE.start___ldv_list_add_~prev#1.base| (select .cse0 8)) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~prev#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select .cse1 8) 0) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| 0) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (= 8 (select |#length| .cse2)) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| .cse2) (= 0 (select .cse1 |ULTIMATE.start___ldv_list_add_~new#1.offset|)) (<= (+ |ULTIMATE.start___ldv_list_add_~new#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|))))) [2024-12-05 23:54:48,577 INFO L77 FloydHoareUtils]: At program point L772(line 772) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4))) (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_14_~n~1#1.base|) 1) (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_free_14_~p~1#1.offset| 0) (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_free_14_~n~1#1.base|)) (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1) (<= (+ |ULTIMATE.start_free_14_~n~1#1.offset| 12) (select |#length| |ULTIMATE.start_free_14_~n~1#1.base|)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (<= 0 .cse0) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= .cse0 |ULTIMATE.start_free_14_~plist#1.offset|))) [2024-12-05 23:54:48,577 INFO L77 FloydHoareUtils]: At program point L772-1(line 772) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4))) (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_14_~n~1#1.base|) 1) (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_free_14_~n~1#1.base|)) (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1) (<= (+ |ULTIMATE.start_free_14_~n~1#1.offset| 12) (select |#length| |ULTIMATE.start_free_14_~n~1#1.base|)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (<= 0 .cse0) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= .cse0 |ULTIMATE.start_free_14_~plist#1.offset|))) [2024-12-05 23:54:48,577 INFO L77 FloydHoareUtils]: At program point L772-2(line 772) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4))) (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_14_~n~1#1.base|) 1) (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_free_14_~n~1#1.base|)) (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1) (<= (+ |ULTIMATE.start_free_14_~n~1#1.offset| 12) (select |#length| |ULTIMATE.start_free_14_~n~1#1.base|)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (<= 0 .cse0) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= .cse0 |ULTIMATE.start_free_14_~plist#1.offset|))) [2024-12-05 23:54:48,577 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 23:54:48,577 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,577 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,577 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,577 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,577 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,577 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,578 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~prev#1.base|) 1) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~next#1.base|) 1) (= |ULTIMATE.start_free_14_~p~1#1.offset| 0) (<= |ULTIMATE.start___ldv_list_del_~next#1.offset| |ULTIMATE.start_free_14_~plist#1.offset|) (= 8 (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|) (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1) (= |ULTIMATE.start___ldv_list_del_~next#1.offset| 0) (= |ULTIMATE.start___ldv_list_del_~next#1.offset| (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4)) (= |ULTIMATE.start___ldv_list_del_~prev#1.offset| 0) (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (= 8 (select |#length| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-12-05 23:54:48,578 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 23:54:48,578 INFO L77 FloydHoareUtils]: At program point L554-1(line 554) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~prev#1.base|) 1) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~next#1.base|) 1) (= |ULTIMATE.start_free_14_~p~1#1.offset| 0) (<= 0 |ULTIMATE.start___ldv_list_del_~next#1.offset|) (<= |ULTIMATE.start___ldv_list_del_~next#1.offset| |ULTIMATE.start_free_14_~plist#1.offset|) (= 8 (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|) (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1) (= |ULTIMATE.start___ldv_list_del_~next#1.offset| (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4)) (= |ULTIMATE.start___ldv_list_del_~prev#1.offset| 0) (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (<= (+ |ULTIMATE.start___ldv_list_del_~next#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-12-05 23:54:48,578 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK(lines 780 782) no Hoare annotation was computed. [2024-12-05 23:54:48,578 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 772) no Hoare annotation was computed. [2024-12-05 23:54:48,578 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 772) no Hoare annotation was computed. [2024-12-05 23:54:48,578 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,578 INFO L77 FloydHoareUtils]: At program point L761(lines 761 766) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~#list_14~0#1.base|))) (let ((.cse2 (= 8 (select |#length| |ULTIMATE.start_entry_point_~#list_14~0#1.base|))) (.cse4 (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| 0)) (.cse3 (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (.cse5 (= (select |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) 1)) (.cse0 (select .cse8 |ULTIMATE.start_entry_point_~#list_14~0#1.offset|)) (.cse1 (select .cse9 |ULTIMATE.start_entry_point_~#list_14~0#1.offset|))) (or (and (= .cse0 |ULTIMATE.start_entry_point_~#list_14~0#1.offset|) (= .cse1 |ULTIMATE.start_entry_point_~#list_14~0#1.base|) .cse2 (= .cse3 |ULTIMATE.start_main_old_#valid#1|) .cse4 .cse5) (let ((.cse7 (select .cse9 0)) (.cse6 (select |#memory_$Pointer$.base| .cse1))) (and (<= (+ .cse0 8) (select |#length| .cse1)) (= (select .cse6 .cse0) |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| .cse7) 8) 0) (= (select |#valid| .cse1) 1) .cse2 .cse4 (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (= (store .cse3 .cse1 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#length| (select (select |#memory_$Pointer$.base| .cse7) 8)) 8) (= (select |#valid| (select .cse6 8)) 1) .cse5 (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| (select (select |#memory_$Pointer$.offset| .cse1) .cse0)) (= (select .cse8 0) 4)))))) [2024-12-05 23:54:48,579 INFO L77 FloydHoareUtils]: At program point L567(line 567) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_del_~entry#1.base|))) (let ((.cse5 (select .cse1 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse0 (select .cse3 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~p~1#1.base|)) (.cse4 (select .cse3 8))) (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_free_14_~p~1#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (= (select .cse1 8) 0) (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1) (= .cse2 .cse3) (= (select |#length| .cse4) 8) (= .cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~p~1#1.base|)) (= .cse5 0) (<= .cse5 |ULTIMATE.start_free_14_~plist#1.offset|) (= 8 (select |#length| .cse0)) (= .cse5 (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (not (= |ULTIMATE.start_free_14_~p~1#1.base| .cse0)) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_14_~n~1#1.base| (select .cse2 (+ |ULTIMATE.start_free_14_~p~1#1.offset| 4))) (= (select |#valid| .cse4) 1) (= |ULTIMATE.start_ldv_list_del_~entry#1.offset| 4) (<= (+ |ULTIMATE.start_ldv_list_del_~entry#1.offset| 8) (select |#length| |ULTIMATE.start_ldv_list_del_~entry#1.base|))))) [2024-12-05 23:54:48,579 INFO L77 FloydHoareUtils]: At program point L567-1(line 567) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_del_~entry#1.base|))) (let ((.cse4 (select .cse3 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse0 (select .cse2 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~p~1#1.base|))) (and (not (= |ULTIMATE.start_free_14_~p~1#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) (<= (+ |ULTIMATE.start_free_14_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|) 1) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_free_14_~p~1#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (= |ULTIMATE.start_ldv_list_del_#t~mem16#1.offset| 0) (= (select |#valid| |ULTIMATE.start_free_14_~p~1#1.base|) 1) (= .cse1 .cse2) (= .cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~p~1#1.base|)) (= .cse4 0) (= (select |#length| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|) 8) (<= .cse4 |ULTIMATE.start_free_14_~plist#1.offset|) (= 8 (select |#length| .cse0)) (= .cse4 (+ |ULTIMATE.start_free_14_~n~1#1.offset| 4)) (= |ULTIMATE.start_free_14_~n~1#1.base| |ULTIMATE.start_free_14_~plist#1.base|) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) (not (= |ULTIMATE.start_free_14_~p~1#1.base| .cse0)) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_free_14_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_14_~n~1#1.base| (select .cse1 (+ |ULTIMATE.start_free_14_~p~1#1.offset| 4))) (= |ULTIMATE.start_ldv_list_del_~entry#1.offset| 4) (<= (+ |ULTIMATE.start_ldv_list_del_~entry#1.offset| 8) (select |#length| |ULTIMATE.start_ldv_list_del_~entry#1.base|))))) [2024-12-05 23:54:48,579 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,579 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,579 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,579 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,580 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (select |#length| |ULTIMATE.start_ldv_list_add_~head#1.base|)) (.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_add_~head#1.base|) |ULTIMATE.start_ldv_list_add_~head#1.offset|))) (and (<= (+ |ULTIMATE.start_ldv_list_add_~new#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_ldv_list_add_~head#1.base|) 1) (= 12 (select |#length| |ULTIMATE.start_ldv_list_add_~new#1.base|)) (= |ULTIMATE.start_ldv_list_add_~head#1.offset| 0) (= .cse0 8) (= 4 |ULTIMATE.start_ldv_list_add_~new#1.offset|) (= |ULTIMATE.start_ldv_list_add_~head#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (<= (+ .cse1 8) .cse0) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start_ldv_list_add_~new#1.base| 0)) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| 0) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (<= |ULTIMATE.start_ldv_list_add_~head#1.offset| .cse1) (= (select |#valid| |ULTIMATE.start_ldv_list_add_~new#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_add_~head#1.base|) |ULTIMATE.start_ldv_list_add_~head#1.offset|) |ULTIMATE.start_ldv_list_add_~head#1.base|))) [2024-12-05 23:54:48,580 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:54:48,580 INFO L77 FloydHoareUtils]: At program point L547(line 547) the Hoare annotation is: (and (= (select |#length| |ULTIMATE.start___ldv_list_add_~next#1.base|) 8) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|) 12) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~next#1.base|) 1) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| 0) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (= |ULTIMATE.start___ldv_list_add_~next#1.offset| 0) (= |ULTIMATE.start___ldv_list_add_~next#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) [2024-12-05 23:54:48,580 INFO L77 FloydHoareUtils]: At program point L547-1(line 547) the Hoare annotation is: (and (= (select |#length| |ULTIMATE.start___ldv_list_add_~next#1.base|) 8) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (= (store (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0) |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|) 12) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~next#1.base|) 1) (= |ULTIMATE.start_entry_point_~#list_14~0#1.offset| 0) (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (= |ULTIMATE.start___ldv_list_add_~next#1.offset| 0) (= |ULTIMATE.start___ldv_list_add_~next#1.base| |ULTIMATE.start_entry_point_~#list_14~0#1.base|)) [2024-12-05 23:54:48,580 INFO L77 FloydHoareUtils]: At program point L770(line 770) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_14_~plist#1.base|) |ULTIMATE.start_free_14_~plist#1.offset|))) (let ((.cse3 (store |#valid| |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (.cse2 (= 8 (select |#length| |ULTIMATE.start_free_14_~plist#1.base|))) (.cse4 (<= (+ 8 .cse1) (select |#length| .cse0))) (.cse5 (= (select |#valid| |ULTIMATE.start_free_14_~plist#1.base|) 1))) (or (and (= |ULTIMATE.start_free_14_~plist#1.offset| 0) (= .cse0 |ULTIMATE.start_free_14_~plist#1.base|) (<= 0 .cse1) .cse2 (= .cse3 |ULTIMATE.start_main_old_#valid#1|) .cse4 .cse5) (let ((.cse7 (select |#memory_$Pointer$.base| .cse0)) (.cse9 (select |#memory_$Pointer$.offset| .cse0))) (let ((.cse8 (select .cse9 .cse1)) (.cse6 (select .cse7 8))) (and (= (store .cse3 .cse0 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#length| .cse6) 8) (= (select .cse7 .cse1) |ULTIMATE.start_free_14_~plist#1.base|) (= .cse8 0) (= 4 .cse1) (<= .cse8 |ULTIMATE.start_free_14_~plist#1.offset|) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#valid| .cse0) 1) .cse2 (= (select .cse9 8) 0) .cse4 (not (= |ULTIMATE.start_entry_point_~#list_14~0#1.base| 0)) (<= |ULTIMATE.start_free_14_~plist#1.offset| 0) .cse5 (= (select |#valid| .cse6) 1) (not (= .cse0 |ULTIMATE.start_entry_point_~#list_14~0#1.base|)))))))) [2024-12-05 23:54:48,589 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~plist!offset [2024-12-05 23:54:48,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~plist!base [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 23:54:48,592 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 23:54:48,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 23:54:48,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-12-05 23:54:48,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!offset [2024-12-05 23:54:48,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-05 23:54:48,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-05 23:54:48,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~plist!offset [2024-12-05 23:54:48,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~plist!base [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 23:54:48,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list_14~0!base [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~plist!offset [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!base [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 23:54:48,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 23:54:48,597 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-05 23:54:48,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 11:54:48 ImpRootNode [2024-12-05 23:54:48,598 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 23:54:48,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 23:54:48,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 23:54:48,599 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 23:54:48,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:48:05" (3/4) ... [2024-12-05 23:54:48,602 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 23:54:48,608 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-12-05 23:54:48,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-12-05 23:54:48,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-05 23:54:48,679 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 23:54:48,679 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 23:54:48,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 23:54:48,680 INFO L158 Benchmark]: Toolchain (without parser) took 404248.86ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 116.1MB in the beginning and 684.7MB in the end (delta: -568.7MB). Peak memory consumption was 429.5MB. Max. memory is 16.1GB. [2024-12-05 23:54:48,680 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:54:48,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.07ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 93.5MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 23:54:48,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:54:48,681 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:54:48,681 INFO L158 Benchmark]: RCFGBuilder took 430.44ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 63.3MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 23:54:48,682 INFO L158 Benchmark]: CodeCheck took 403243.51ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 63.3MB in the beginning and 689.1MB in the end (delta: -625.7MB). Peak memory consumption was 370.8MB. Max. memory is 16.1GB. [2024-12-05 23:54:48,682 INFO L158 Benchmark]: Witness Printer took 80.90ms. Allocated memory is still 1.1GB. Free memory was 689.1MB in the beginning and 684.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:54:48,684 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 49 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 398.3s, OverallIterations: 52, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4217 SdHoareTripleChecker+Valid, 54.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3803 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 48.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37684 IncrementalHoareTripleChecker+Invalid, 46943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9259 mSolverCounterUnsat, 0 mSDtfsCounter, 37684 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6252 GetRequests, 4889 SyntacticMatches, 191 SemanticMatches, 1172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620394 ImplicationChecksByTransitivity, 387.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 70.9s InterpolantComputationTime, 593 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 7208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 48 PerfectInterpolantSequences, 7/11 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: 772]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 772]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 772]: free always succeeds For all program executions holds that free 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: 780]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.07ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 93.5MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 430.44ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 63.3MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 403243.51ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 63.3MB in the beginning and 689.1MB in the end (delta: -625.7MB). Peak memory consumption was 370.8MB. Max. memory is 16.1GB. * Witness Printer took 80.90ms. Allocated memory is still 1.1GB. Free memory was 689.1MB in the beginning and 684.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~plist!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: ~p~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~plist!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - 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: ~p~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!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: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~plist!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~plist!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - 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: ~#list_14~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~plist!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!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: ~n~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] RESULT: Ultimate proved your program to be correct! [2024-12-05 23:54:48,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0411988-375c-4b76-ba4b-7930b350a0d2/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