./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.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_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/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_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/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_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:10:28,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:10:28,213 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-12-06 05:10:28,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:10:28,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:10:28,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:10:28,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:10:28,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:10:28,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:10:28,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:10:28,238 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:10:28,238 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:10:28,238 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:10:28,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:10:28,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:10:28,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:10:28,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:10:28,238 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:10:28,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:10:28,238 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_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2024-12-06 05:10:28,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:10:28,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:10:28,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:10:28,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:10:28,479 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:10:28,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-12-06 05:10:31,201 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/data/878248b27/c2768b4fc2b446eeba6f5b950d8c27ad/FLAGcbfd1118f [2024-12-06 05:10:31,436 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:10:31,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-12-06 05:10:31,449 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/data/878248b27/c2768b4fc2b446eeba6f5b950d8c27ad/FLAGcbfd1118f [2024-12-06 05:10:31,463 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/data/878248b27/c2768b4fc2b446eeba6f5b950d8c27ad [2024-12-06 05:10:31,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:10:31,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:10:31,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:10:31,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:10:31,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:10:31,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6295cb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31, skipping insertion in model container [2024-12-06 05:10:31,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:10:31,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:10:31,850 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:10:31,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:10:31,930 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:10:31,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31 WrapperNode [2024-12-06 05:10:31,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:10:31,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:10:31,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:10:31,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:10:31,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,964 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 34, calls inlined = 11, statements flattened = 91 [2024-12-06 05:10:31,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:10:31,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:10:31,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:10:31,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:10:31,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:10:31,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:10:31,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:10:31,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:10:31,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:31" (1/1) ... [2024-12-06 05:10:31,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:10:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:10:32,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:10:32,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:10:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-06 05:10:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:10:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-12-06 05:10:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-12-06 05:10:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 05:10:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-12-06 05:10:32,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:10:32,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:10:32,149 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:10:32,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:10:32,387 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-12-06 05:10:32,387 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:10:32,444 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:10:32,444 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 05:10:32,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:10:32 BoogieIcfgContainer [2024-12-06 05:10:32,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:10:32,445 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:10:32,445 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:10:32,468 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:10:32,468 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:10:32" (1/1) ... [2024-12-06 05:10:32,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:10:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 55 states and 56 transitions. [2024-12-06 05:10:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2024-12-06 05:10:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 05:10:32,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 54 states and 55 transitions. [2024-12-06 05:10:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-12-06 05:10:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 05:10:32,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 53 states and 54 transitions. [2024-12-06 05:10:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-12-06 05:10:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 05:10:33,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 55 states and 57 transitions. [2024-12-06 05:10:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-12-06 05:10:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 05:10:33,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 57 states and 60 transitions. [2024-12-06 05:10:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-12-06 05:10:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 05:10:34,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 56 states and 59 transitions. [2024-12-06 05:10:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-12-06 05:10:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 05:10:34,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:34,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 55 states and 58 transitions. [2024-12-06 05:10:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-12-06 05:10:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 05:10:35,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:35,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 58 states and 64 transitions. [2024-12-06 05:10:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-12-06 05:10:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 05:10:36,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 61 states and 71 transitions. [2024-12-06 05:10:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-12-06 05:10:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 05:10:37,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:37,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 60 states and 70 transitions. [2024-12-06 05:10:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-12-06 05:10:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 05:10:38,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 59 states and 69 transitions. [2024-12-06 05:10:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-12-06 05:10:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 05:10:39,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 58 states and 68 transitions. [2024-12-06 05:10:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-12-06 05:10:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 05:10:39,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 57 states and 67 transitions. [2024-12-06 05:10:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-12-06 05:10:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:10:40,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 59 states and 70 transitions. [2024-12-06 05:10:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-12-06 05:10:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:10:41,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 61 states and 73 transitions. [2024-12-06 05:10:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-12-06 05:10:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:10:41,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 64 states and 78 transitions. [2024-12-06 05:10:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2024-12-06 05:10:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:10:43,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 63 states and 77 transitions. [2024-12-06 05:10:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2024-12-06 05:10:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:10:44,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:44,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 62 states and 76 transitions. [2024-12-06 05:10:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-12-06 05:10:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 05:10:47,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 61 states and 75 transitions. [2024-12-06 05:10:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-12-06 05:10:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 05:10:47,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 62 states and 76 transitions. [2024-12-06 05:10:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-12-06 05:10:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 05:10:47,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:48,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-06 05:10:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 69 states and 86 transitions. [2024-12-06 05:10:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2024-12-06 05:10:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 05:10:50,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 66 states and 82 transitions. [2024-12-06 05:10:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-12-06 05:10:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 05:10:52,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:53,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-06 05:10:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 65 states and 81 transitions. [2024-12-06 05:10:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2024-12-06 05:10:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 05:10:56,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 66 states and 84 transitions. [2024-12-06 05:11:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-12-06 05:11:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 05:11:01,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:01,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 66 states and 83 transitions. [2024-12-06 05:11:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-12-06 05:11:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 05:11:02,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 66 states and 82 transitions. [2024-12-06 05:11:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-12-06 05:11:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 05:11:03,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 65 states and 78 transitions. [2024-12-06 05:11:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2024-12-06 05:11:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 05:11:04,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 62 states and 75 transitions. [2024-12-06 05:11:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2024-12-06 05:11:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:11:05,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:05,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 64 states and 78 transitions. [2024-12-06 05:11:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2024-12-06 05:11:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:11:05,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 58 states and 68 transitions. [2024-12-06 05:11:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-12-06 05:11:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:11:09,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 60 states and 71 transitions. [2024-12-06 05:11:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-12-06 05:11:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:11:10,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 59 states and 70 transitions. [2024-12-06 05:11:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-12-06 05:11:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:11:10,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 60 states and 71 transitions. [2024-12-06 05:11:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-12-06 05:11:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:11:11,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 65 states and 82 transitions. [2024-12-06 05:11:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2024-12-06 05:11:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:11:19,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:19,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 70 states and 93 transitions. [2024-12-06 05:11:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2024-12-06 05:11:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:11:29,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:29,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 69 states and 89 transitions. [2024-12-06 05:11:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-12-06 05:11:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:11:31,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 68 states and 87 transitions. [2024-12-06 05:11:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-12-06 05:11:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:11:33,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 69 states and 90 transitions. [2024-12-06 05:11:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-12-06 05:11:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:11:34,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 69 states and 89 transitions. [2024-12-06 05:11:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-12-06 05:11:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:11:36,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 75 states and 103 transitions. [2024-12-06 05:11:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-12-06 05:11:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:11:49,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:12:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 77 states and 114 transitions. [2024-12-06 05:12:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-12-06 05:12:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:12:03,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:12:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 78 states and 115 transitions. [2024-12-06 05:12:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2024-12-06 05:12:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:12:06,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:12:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 77 states and 112 transitions. [2024-12-06 05:12:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2024-12-06 05:12:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 05:12:09,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:12:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 80 states and 118 transitions. [2024-12-06 05:12:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-12-06 05:12:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:12:16,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:12:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 87 states and 134 transitions. [2024-12-06 05:12:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-12-06 05:12:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 05:12:34,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:12:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 92 states and 143 transitions. [2024-12-06 05:12:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-12-06 05:12:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 05:12:41,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:13:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:13:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 101 states and 179 transitions. [2024-12-06 05:13:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 179 transitions. [2024-12-06 05:13:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 05:13:03,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:13:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:13:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:13:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:13:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:13:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 109 states and 198 transitions. [2024-12-06 05:13:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 198 transitions. [2024-12-06 05:13:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 05:13:26,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:13:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:13:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:13:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:13:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:13:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 119 states and 225 transitions. [2024-12-06 05:13:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 225 transitions. [2024-12-06 05:13:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 05:13:44,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:13:44,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:13:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:13:45,264 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-06 05:13:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:13:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 119 states and 223 transitions. [2024-12-06 05:13:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 223 transitions. [2024-12-06 05:13:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 05:13:46,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:13:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:13:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:13:49,720 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-06 05:13:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:13:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 119 states and 222 transitions. [2024-12-06 05:13:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 222 transitions. [2024-12-06 05:13:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:13:53,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:13:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:13:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:13:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:13:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:13:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 120 states and 224 transitions. [2024-12-06 05:13:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 224 transitions. [2024-12-06 05:13:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:13:58,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:13:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:13:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:03,833 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-06 05:14:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 35 states and 39 transitions. [2024-12-06 05:14:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-12-06 05:14:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:14:24,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:27,486 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-06 05:15:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 34 states and 37 transitions. [2024-12-06 05:15:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-12-06 05:15:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:15:01,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:01,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:03,875 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-06 05:15:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 30 states and 32 transitions. [2024-12-06 05:15:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-12-06 05:15:09,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:15:09,013 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 55 iterations. [2024-12-06 05:15:09,019 INFO L726 CodeCheckObserver]: All specifications hold 32 specifications checked. All of them hold [2024-12-06 05:15:12,316 INFO L77 FloydHoareUtils]: At program point L762(lines 762 767) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (let ((.cse6 (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|)) (.cse0 (select .cse7 |~#global_list_13~0.offset|)) (.cse3 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse4 (= |~#global_list_13~0.offset| 0)) (.cse5 (select .cse7 0))) (or (let ((.cse1 (select |#memory_$Pointer$.base| .cse0)) (.cse2 (select .cse6 |~#global_list_13~0.offset|))) (and (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| .cse0 0)) (= |~#global_list_13~0.base| (select .cse1 8)) (<= (+ .cse0 1) |#StackHeapBarrier|) (= .cse2 4) .cse3 (= (select |#valid| .cse0) 1) (= (select |#length| |~#global_list_13~0.base|) 8) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= |~#global_list_13~0.base| (select .cse1 .cse2)) .cse4 (= (select (select |#memory_$Pointer$.offset| .cse5) 8) 0) (<= (+ .cse2 8) (select |#length| .cse0)))) (and (= (select .cse6 0) 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= .cse0 |~#global_list_13~0.base|) .cse3 (= 8 (select |#length| 2)) .cse4 (= 2 .cse5))))) [2024-12-06 05:15:12,316 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,316 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,317 INFO L77 FloydHoareUtils]: At program point L548(line 548) the Hoare annotation is: (and (= (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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|) |ULTIMATE.start___ldv_list_add_~new#1.offset|) |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start___ldv_list_add_~new#1.base|) |ULTIMATE.start___ldv_list_add_~new#1.offset|)) (= (select |#length| |ULTIMATE.start___ldv_list_add_~prev#1.base|) 8) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| 0) (<= (+ |ULTIMATE.start___ldv_list_add_~new#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|))) [2024-12-06 05:15:12,317 INFO L77 FloydHoareUtils]: At program point L771(line 771) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (let ((.cse6 (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|)) (.cse0 (select .cse7 |~#global_list_13~0.offset|)) (.cse3 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse4 (= |~#global_list_13~0.offset| 0)) (.cse5 (select .cse7 0))) (or (let ((.cse1 (select |#memory_$Pointer$.base| .cse0)) (.cse2 (select .cse6 |~#global_list_13~0.offset|))) (and (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| .cse0 0)) (= |~#global_list_13~0.base| (select .cse1 8)) (<= (+ .cse0 1) |#StackHeapBarrier|) (= .cse2 4) .cse3 (= (select |#valid| .cse0) 1) (= (select |#length| |~#global_list_13~0.base|) 8) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= |~#global_list_13~0.base| (select .cse1 .cse2)) .cse4 (= (select (select |#memory_$Pointer$.offset| .cse5) 8) 0) (<= (+ .cse2 8) (select |#length| .cse0)))) (and (= (select .cse6 0) 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= .cse0 |~#global_list_13~0.base|) .cse3 (= 8 (select |#length| 2)) .cse4 (= 2 .cse5))))) [2024-12-06 05:15:12,317 INFO L77 FloydHoareUtils]: At program point L771-2(line 771) the Hoare annotation is: (let ((.cse4 (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1)) (.cse1 (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4)) (.cse5 (= |~#global_list_13~0.offset| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|))) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|)) (.cse2 (select .cse0 8))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select .cse0 .cse1) |~#global_list_13~0.base|) (= .cse2 |~#global_list_13~0.base|) (= (select .cse3 8) 0) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#valid| |~#global_list_13~0.base|) 1) .cse4 (= |~#global_list_13~0.offset| (select .cse3 .cse1)) (<= (+ 12 |ULTIMATE.start_free_13_~p~1#1.offset|) (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= (select |#length| .cse2) 8) .cse5))) (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|) .cse4 (= 2 |~#global_list_13~0.base|) (= 8 (select |#length| 2)) (= .cse1 |~#global_list_13~0.offset|) .cse5))) [2024-12-06 05:15:12,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK(lines 781 783) no Hoare annotation was computed. [2024-12-06 05:15:12,318 INFO L77 FloydHoareUtils]: At program point L771-7(line 771) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|) (<= 0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4)) (<= |ULTIMATE.start_free_13_~n~1#1.offset| |ULTIMATE.start_free_13_~p~1#1.offset|) (= (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4) |~#global_list_13~0.offset|) (<= (+ 12 |ULTIMATE.start_free_13_~p~1#1.offset|) (select |#length| |ULTIMATE.start_free_13_~n~1#1.base|))) [2024-12-06 05:15:12,318 INFO L77 FloydHoareUtils]: At program point L540(line 540) the Hoare annotation is: (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= (select |#valid| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|) 1) (<= (+ |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset| 8) (select |#length| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|)) (<= 0 |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset|)) [2024-12-06 05:15:12,318 INFO L77 FloydHoareUtils]: At program point L540-1(line 540) the Hoare annotation is: (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= (select |#valid| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|) 1) (<= (+ |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset| 8) (select |#length| |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.base|)) (<= 0 |ULTIMATE.start_LDV_INIT_LIST_HEAD_~list#1.offset|)) [2024-12-06 05:15:12,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,318 INFO L77 FloydHoareUtils]: At program point L771-9(lines 771 774) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse1 (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (or (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|) (<= 0 |~#global_list_13~0.offset|) .cse0 (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= .cse1 |~#global_list_13~0.offset|)) (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|))) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|)) (.cse4 (select .cse2 8))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select .cse2 .cse1) |~#global_list_13~0.base|) (= (select .cse3 4) |~#global_list_13~0.offset|) (= .cse4 |~#global_list_13~0.base|) (= (select .cse3 8) 0) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse0 (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= (select .cse2 4) |ULTIMATE.start_free_13_~n~1#1.base|) (<= (+ 12 |ULTIMATE.start_free_13_~p~1#1.offset|) (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4) (select .cse3 .cse1)) (= (select |#length| .cse4) 8) (= |~#global_list_13~0.offset| 0)))))) [2024-12-06 05:15:12,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,319 INFO L77 FloydHoareUtils]: At program point L549(line 549) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|))) (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start___ldv_list_add_~new#1.base|)) (.cse2 (select .cse1 8))) (and (= (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) (= (select .cse0 8) 0) (= (select .cse1 |ULTIMATE.start___ldv_list_add_~new#1.offset|) |~#global_list_13~0.base|) (= .cse2 |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |~#global_list_13~0.offset| (select .cse0 |ULTIMATE.start___ldv_list_add_~new#1.offset|)) (= (select |#length| .cse2) 8) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| 0) (<= (+ |ULTIMATE.start___ldv_list_add_~new#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|))))) [2024-12-06 05:15:12,319 INFO L77 FloydHoareUtils]: At program point L764(lines 764 766) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_alloc_13_~p~0#1.base| 0)) (.cse3 (= |ULTIMATE.start_alloc_13_~p~0#1.offset| 0))) (let ((.cse1 (and .cse0 .cse3)) (.cse2 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (and (or .cse0 (= (store |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (or (= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) 1) .cse1) (<= (+ |ULTIMATE.start_alloc_13_~p~0#1.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) 0) 0) (or (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (not .cse0)) (= (select .cse2 |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (or .cse1 (and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) 12) .cse3)) (= (select |#length| |~#global_list_13~0.base|) 8) (= |~#global_list_13~0.offset| 0) (= 2 (select .cse2 0))))) [2024-12-06 05:15:12,319 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,319 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,319 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,319 INFO L77 FloydHoareUtils]: At program point L781(lines 781 783) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 05:15:12,319 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:15:12,319 INFO L77 FloydHoareUtils]: At program point L773(line 773) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= .cse0 |~#global_list_13~0.offset|) (<= |~#global_list_13~0.offset| 0))) [2024-12-06 05:15:12,320 INFO L77 FloydHoareUtils]: At program point L773-1(line 773) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= .cse0 |~#global_list_13~0.offset|) (<= |~#global_list_13~0.offset| 0))) [2024-12-06 05:15:12,320 INFO L77 FloydHoareUtils]: At program point L773-2(line 773) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= (select |#valid| |ULTIMATE.start_free_13_~n~1#1.base|) 1) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_free_13_~n~1#1.base|)) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= .cse0 |~#global_list_13~0.offset|) (<= |~#global_list_13~0.offset| 0))) [2024-12-06 05:15:12,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-12-06 05:15:12,320 INFO L77 FloydHoareUtils]: At program point L567(line 567) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|))) (let ((.cse1 (select .cse5 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse4 (select .cse0 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|)) (.cse2 (select .cse5 8))) (and (= .cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|)) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| .cse1) 1) (= 1 (select |#valid| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (= (select .cse0 8) 0) (not (= |ULTIMATE.start_free_13_~p~1#1.base| .cse1)) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (= (select |#length| .cse2) 8) (<= (select |#length| |ULTIMATE.start_free_13_~n~1#1.base|) (+ 8 |~#global_list_13~0.offset|)) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= (select .cse3 4) |ULTIMATE.start_free_13_~n~1#1.base|) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= (+ .cse4 8) (select |#length| .cse1)) (= .cse4 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4)) (<= 0 .cse4) (= .cse5 .cse3) (<= |~#global_list_13~0.offset| 0) (= (select |#valid| .cse2) 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-06 05:15:12,320 INFO L77 FloydHoareUtils]: At program point L567-1(line 567) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|))) (let ((.cse1 (select .cse4 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse3 (select .cse0 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|))) (and (= (select |#valid| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|) 1) (= .cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|)) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| .cse1) 1) (= 1 (select |#valid| |ULTIMATE.start_ldv_list_del_~entry#1.base|)) (= |ULTIMATE.start_ldv_list_del_#t~mem16#1.offset| 0) (not (= |ULTIMATE.start_free_13_~p~1#1.base| .cse1)) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (<= (select |#length| |ULTIMATE.start_free_13_~n~1#1.base|) (+ 8 |~#global_list_13~0.offset|)) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= (select |#length| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|) 8) (= (select .cse2 4) |ULTIMATE.start_free_13_~n~1#1.base|) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= (+ .cse3 8) (select |#length| .cse1)) (= .cse3 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4)) (<= 0 .cse3) (= .cse4 .cse2) (<= |~#global_list_13~0.offset| 0) (= |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-06 05:15:12,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (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|)) (= (select |#length| |ULTIMATE.start_ldv_list_add_~head#1.base|) 8) (= 4 |ULTIMATE.start_ldv_list_add_~new#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_add_~head#1.base|) |ULTIMATE.start_ldv_list_add_~head#1.offset|) 0) (= (store |#valid| |ULTIMATE.start_ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |~#global_list_13~0.offset| |ULTIMATE.start_ldv_list_add_~head#1.offset|) (= |~#global_list_13~0.offset| 0) (= |ULTIMATE.start_ldv_list_add_~head#1.base| |~#global_list_13~0.base|) (= (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-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,321 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,322 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start___ldv_list_del_~prev#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~next#1.base|) 1) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (<= 0 |ULTIMATE.start___ldv_list_del_~next#1.offset|) (= 8 (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (<= (select |#length| |ULTIMATE.start_free_13_~n~1#1.base|) (+ 8 |~#global_list_13~0.offset|)) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= |ULTIMATE.start___ldv_list_del_~prev#1.offset| 0) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4) |ULTIMATE.start___ldv_list_del_~next#1.offset|) (<= (+ |ULTIMATE.start___ldv_list_del_~next#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (<= |~#global_list_13~0.offset| 0)) [2024-12-06 05:15:12,322 INFO L77 FloydHoareUtils]: At program point L554-1(line 554) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start___ldv_list_del_~prev#1.base|) 1) (not (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|)) (= (select |#valid| |ULTIMATE.start___ldv_list_del_~next#1.base|) 1) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (<= 0 |ULTIMATE.start___ldv_list_del_~next#1.offset|) (= 8 (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_13_~n~1#1.base| |ULTIMATE.start___ldv_list_del_~next#1.base|) (= |ULTIMATE.start_free_13_~n~1#1.base| |~#global_list_13~0.base|) (<= (+ |ULTIMATE.start___ldv_list_del_~next#1.offset| (select |#length| |ULTIMATE.start_free_13_~n~1#1.base|)) (+ |~#global_list_13~0.offset| (select |#length| |ULTIMATE.start___ldv_list_del_~next#1.base|))) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= |ULTIMATE.start___ldv_list_del_~prev#1.offset| 0) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4) |ULTIMATE.start___ldv_list_del_~next#1.offset|) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0)) [2024-12-06 05:15:12,322 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,322 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-12-06 05:15:12,322 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,322 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,322 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,322 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 05:15:12,322 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) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| 0) (= (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) (= (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|) 12) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~next#1.base|) 1) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start___ldv_list_add_~next#1.offset| 0) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (= |~#global_list_13~0.base| |ULTIMATE.start___ldv_list_add_~next#1.base|)) [2024-12-06 05:15:12,322 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) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| 0) (= (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) (= (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|) 12) (= |ULTIMATE.start___ldv_list_add_~prev#1.offset| |~#global_list_13~0.offset|) (= (select |#valid| |ULTIMATE.start___ldv_list_add_~next#1.base|) 1) (= (store |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start___ldv_list_add_~next#1.offset| 0) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (= |~#global_list_13~0.base| |ULTIMATE.start___ldv_list_add_~next#1.base|)) [2024-12-06 05:15:12,329 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 05:15:12,329 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:15:12,330 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-12-06 05:15:12,330 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-06 05:15:12,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-12-06 05:15:12,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!base [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-12-06 05:15:12,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!offset [2024-12-06 05:15:12,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-06 05:15:12,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-06 05:15:12,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-12-06 05:15:12,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 05:15:12,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 05:15:12,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-12-06 05:15:12,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:15:12 ImpRootNode [2024-12-06 05:15:12,335 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:15:12,335 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:15:12,335 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:15:12,335 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:15:12,336 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:10:32" (3/4) ... [2024-12-06 05:15:12,337 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:15:12,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-12-06 05:15:12,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-12-06 05:15:12,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-06 05:15:12,402 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:15:12,402 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:15:12,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:15:12,403 INFO L158 Benchmark]: Toolchain (without parser) took 280936.12ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 91.2MB in the beginning and 521.8MB in the end (delta: -430.6MB). Peak memory consumption was 543.8MB. Max. memory is 16.1GB. [2024-12-06 05:15:12,403 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:15:12,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.64ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 68.9MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:15:12,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.14ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:15:12,404 INFO L158 Benchmark]: Boogie Preprocessor took 21.16ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 65.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:15:12,404 INFO L158 Benchmark]: RCFGBuilder took 458.48ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 38.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:15:12,404 INFO L158 Benchmark]: CodeCheck took 279889.43ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 38.6MB in the beginning and 526.2MB in the end (delta: -487.6MB). Peak memory consumption was 485.0MB. Max. memory is 16.1GB. [2024-12-06 05:15:12,404 INFO L158 Benchmark]: Witness Printer took 66.84ms. Allocated memory is still 1.1GB. Free memory was 526.2MB in the beginning and 521.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:15:12,406 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, 55 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 276.5s, OverallIterations: 55, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6329 SdHoareTripleChecker+Valid, 47.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5862 mSDsluCounter, 2450 SdHoareTripleChecker+Invalid, 41.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2220 mSDsCounter, 8417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33401 IncrementalHoareTripleChecker+Invalid, 41818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8417 mSolverCounterUnsat, 230 mSDtfsCounter, 33401 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6110 GetRequests, 4825 SyntacticMatches, 213 SemanticMatches, 1072 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571255 ImplicationChecksByTransitivity, 266.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 50.8s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 577 ConstructedInterpolants, 0 QuantifiedInterpolants, 7219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 50 PerfectInterpolantSequences, 7/12 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: 773]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 773]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 773]: 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: -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: 781]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.64ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 68.9MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.14ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.16ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 65.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 458.48ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 38.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 279889.43ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 38.6MB in the beginning and 526.2MB in the end (delta: -487.6MB). Peak memory consumption was 485.0MB. Max. memory is 16.1GB. * Witness Printer took 66.84ms. Allocated memory is still 1.1GB. Free memory was 526.2MB in the beginning and 521.8MB 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: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!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: Unknown variable: ~#global_list_13~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset - 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: #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: ~#global_list_13~0!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: Unknown variable: ~#global_list_13~0!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: ~#global_list_13~0!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: #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: #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: ~n~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: ~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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset RESULT: Ultimate proved your program to be correct! [2024-12-06 05:15:12,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_113a0f1a-6c4f-41f5-b4c7-b38322c2cb55/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