./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm --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-826ab2b [2024-11-13 20:34:18,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:34:18,897 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-13 20:34:18,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:34:18,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:34:18,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:34:18,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:34:18,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:34:18,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:34:18,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:34:18,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:34:18,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:34:18,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:34:18,942 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 20:34:18,942 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 20:34:18,942 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 20:34:18,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:34:18,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:34:18,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 20:34:18,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:34:18,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:34:18,943 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:34:18,943 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:34:18,943 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:34:18,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:34:18,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:34:18,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:34:18,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:34:18,944 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:34:18,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:34:18,945 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_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm 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-11-13 20:34:19,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:34:19,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:34:19,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:34:19,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:34:19,346 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:34:19,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i Unable to find full path for "g++" [2024-11-13 20:34:21,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:34:21,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:34:21,798 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-13 20:34:21,814 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/data/55e5bc944/c96be0ed13f448b7a7c1d1576e42c5b2/FLAGc6d6945f7 [2024-11-13 20:34:21,831 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/data/55e5bc944/c96be0ed13f448b7a7c1d1576e42c5b2 [2024-11-13 20:34:21,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:34:21,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:34:21,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:34:21,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:34:21,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:34:21,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:34:21" (1/1) ... [2024-11-13 20:34:21,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e918789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:21, skipping insertion in model container [2024-11-13 20:34:21,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:34:21" (1/1) ... [2024-11-13 20:34:21,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:34:22,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:34:22,350 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:34:22,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:34:22,547 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:34:22,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22 WrapperNode [2024-11-13 20:34:22,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:34:22,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:34:22,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:34:22,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:34:22,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,629 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 34, calls inlined = 11, statements flattened = 91 [2024-11-13 20:34:22,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:34:22,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:34:22,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:34:22,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:34:22,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:34:22,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:34:22,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:34:22,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:34:22,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:22" (1/1) ... [2024-11-13 20:34:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:34:22,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:34:22,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:34:22,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:34:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 20:34:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:34:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 20:34:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 20:34:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 20:34:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 20:34:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:34:22,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:34:23,000 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:34:23,003 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:34:23,434 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-13 20:34:23,435 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:34:23,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:34:23,542 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:34:23,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:34:23 BoogieIcfgContainer [2024-11-13 20:34:23,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:34:23,543 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:34:23,543 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:34:23,556 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:34:23,557 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:34:23" (1/1) ... [2024-11-13 20:34:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:34:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 55 states and 56 transitions. [2024-11-13 20:34:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2024-11-13 20:34:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:34:23,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 54 states and 55 transitions. [2024-11-13 20:34:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-11-13 20:34:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:34:24,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 53 states and 54 transitions. [2024-11-13 20:34:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-11-13 20:34:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:34:25,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 55 states and 57 transitions. [2024-11-13 20:34:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-13 20:34:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:34:25,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 57 states and 60 transitions. [2024-11-13 20:34:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-11-13 20:34:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:34:26,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 56 states and 59 transitions. [2024-11-13 20:34:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-11-13 20:34:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:34:27,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 55 states and 58 transitions. [2024-11-13 20:34:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-11-13 20:34:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:34:29,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 58 states and 64 transitions. [2024-11-13 20:34:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-13 20:34:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:34:29,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 61 states and 71 transitions. [2024-11-13 20:34:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-11-13 20:34:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:34:31,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:32,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-11-13 20:34:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 60 states and 70 transitions. [2024-11-13 20:34:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-11-13 20:34:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:34:33,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 59 states and 69 transitions. [2024-11-13 20:34:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-11-13 20:34:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:34:36,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 58 states and 68 transitions. [2024-11-13 20:34:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-13 20:34:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:34:36,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 57 states and 67 transitions. [2024-11-13 20:34:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-13 20:34:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:34:38,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 59 states and 72 transitions. [2024-11-13 20:34:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-11-13 20:34:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:34:38,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:39,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-11-13 20:34:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 62 states and 80 transitions. [2024-11-13 20:34:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2024-11-13 20:34:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:34:41,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 64 states and 82 transitions. [2024-11-13 20:34:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-13 20:34:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:34:42,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 63 states and 81 transitions. [2024-11-13 20:34:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-13 20:34:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:34:44,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 62 states and 80 transitions. [2024-11-13 20:34:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2024-11-13 20:34:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:34:48,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:48,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 61 states and 79 transitions. [2024-11-13 20:34:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2024-11-13 20:34:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:34:48,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 62 states and 80 transitions. [2024-11-13 20:34:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2024-11-13 20:34:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:34:49,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 69 states and 90 transitions. [2024-11-13 20:34:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-11-13 20:34:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:34:52,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 69 states and 89 transitions. [2024-11-13 20:34:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-11-13 20:34:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:34:57,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 65 states and 85 transitions. [2024-11-13 20:35:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2024-11-13 20:35:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:35:01,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 66 states and 89 transitions. [2024-11-13 20:35:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2024-11-13 20:35:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:35:08,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 66 states and 88 transitions. [2024-11-13 20:35:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-13 20:35:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:35:10,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 66 states and 87 transitions. [2024-11-13 20:35:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-13 20:35:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:35:12,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:12,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 65 states and 82 transitions. [2024-11-13 20:35:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2024-11-13 20:35:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:35:13,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 62 states and 79 transitions. [2024-11-13 20:35:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-13 20:35:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:14,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:14,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 59 states and 76 transitions. [2024-11-13 20:35:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-13 20:35:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:20,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 59 states and 75 transitions. [2024-11-13 20:35:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-11-13 20:35:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:21,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 61 states and 80 transitions. [2024-11-13 20:35:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-13 20:35:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:22,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 62 states and 85 transitions. [2024-11-13 20:35:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2024-11-13 20:35:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:29,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 63 states and 86 transitions. [2024-11-13 20:35:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-11-13 20:35:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:30,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:30,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 65 states and 92 transitions. [2024-11-13 20:35:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-11-13 20:35:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:33,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 66 states and 93 transitions. [2024-11-13 20:35:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2024-11-13 20:35:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:34,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:34,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 65 states and 91 transitions. [2024-11-13 20:35:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-11-13 20:35:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:35,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 66 states and 92 transitions. [2024-11-13 20:35:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-13 20:35:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:35:36,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:36,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 67 states and 93 transitions. [2024-11-13 20:35:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-11-13 20:35:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:35:37,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 66 states and 92 transitions. [2024-11-13 20:35:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-13 20:35:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:35:37,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:37,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 67 states and 93 transitions. [2024-11-13 20:35:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-11-13 20:35:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:35:39,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 71 states and 105 transitions. [2024-11-13 20:35:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2024-11-13 20:35:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:35:52,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 76 states and 125 transitions. [2024-11-13 20:36:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 125 transitions. [2024-11-13 20:36:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:08,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 77 states and 128 transitions. [2024-11-13 20:36:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 128 transitions. [2024-11-13 20:36:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:12,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 78 states and 133 transitions. [2024-11-13 20:36:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 133 transitions. [2024-11-13 20:36:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:15,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 81 states and 144 transitions. [2024-11-13 20:36:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 144 transitions. [2024-11-13 20:36:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:19,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 82 states and 147 transitions. [2024-11-13 20:36:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 147 transitions. [2024-11-13 20:36:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:22,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 83 states and 151 transitions. [2024-11-13 20:36:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 151 transitions. [2024-11-13 20:36:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:24,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:24,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 82 states and 147 transitions. [2024-11-13 20:36:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 147 transitions. [2024-11-13 20:36:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:26,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 82 states and 143 transitions. [2024-11-13 20:36:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 143 transitions. [2024-11-13 20:36:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:31,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 83 states and 147 transitions. [2024-11-13 20:36:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 147 transitions. [2024-11-13 20:36:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:34,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 83 states and 145 transitions. [2024-11-13 20:36:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2024-11-13 20:36:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:35,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 84 states and 146 transitions. [2024-11-13 20:36:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 146 transitions. [2024-11-13 20:36:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:36:37,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 84 states and 145 transitions. [2024-11-13 20:36:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 145 transitions. [2024-11-13 20:36:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:36:39,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 88 states and 155 transitions. [2024-11-13 20:36:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 155 transitions. [2024-11-13 20:36:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:36:56,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:56,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 91 states and 170 transitions. [2024-11-13 20:37:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2024-11-13 20:37:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:37:19,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 93 states and 181 transitions. [2024-11-13 20:37:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 181 transitions. [2024-11-13 20:37:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:37:29,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 91 states and 176 transitions. [2024-11-13 20:37:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 176 transitions. [2024-11-13 20:37:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:37:48,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 91 states and 175 transitions. [2024-11-13 20:37:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 175 transitions. [2024-11-13 20:37:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:37:53,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 92 states and 176 transitions. [2024-11-13 20:37:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 176 transitions. [2024-11-13 20:37:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:37:57,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 95 states and 182 transitions. [2024-11-13 20:38:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 182 transitions. [2024-11-13 20:38:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:38:09,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 102 states and 203 transitions. [2024-11-13 20:38:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 203 transitions. [2024-11-13 20:38:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:38:40,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 103 states and 204 transitions. [2024-11-13 20:38:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 204 transitions. [2024-11-13 20:38:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 20:38:43,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 108 states and 213 transitions. [2024-11-13 20:38:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 213 transitions. [2024-11-13 20:38:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:38:54,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:54,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:39:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 117 states and 240 transitions. [2024-11-13 20:39:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 240 transitions. [2024-11-13 20:39:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:39:24,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 126 states and 295 transitions. [2024-11-13 20:40:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 295 transitions. [2024-11-13 20:40:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:40:01,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 127 states and 297 transitions. [2024-11-13 20:40:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 297 transitions. [2024-11-13 20:40:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:40:12,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:12,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 127 states and 294 transitions. [2024-11-13 20:40:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 294 transitions. [2024-11-13 20:40:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:40:15,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 128 states and 295 transitions. [2024-11-13 20:40:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 295 transitions. [2024-11-13 20:40:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:40:17,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 129 states and 294 transitions. [2024-11-13 20:40:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 294 transitions. [2024-11-13 20:40:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:40:28,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 20:40:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 139 states and 337 transitions. [2024-11-13 20:40:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 337 transitions. [2024-11-13 20:40:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:40:56,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 140 states and 338 transitions. [2024-11-13 20:40:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 338 transitions. [2024-11-13 20:40:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:40:59,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 20:41:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 141 states and 340 transitions. [2024-11-13 20:41:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 340 transitions. [2024-11-13 20:41:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:41:06,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:41:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 151 states and 404 transitions. [2024-11-13 20:41:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 404 transitions. [2024-11-13 20:41:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:41:57,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:42:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 154 states and 407 transitions. [2024-11-13 20:42:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 407 transitions. [2024-11-13 20:42:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:42:03,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:42:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 31 states and 34 transitions. [2024-11-13 20:42:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-13 20:42:48,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 20:42:48,829 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 75 iterations. [2024-11-13 20:42:48,836 INFO L729 CodeCheckObserver]: All specifications hold 32 specifications checked. All of them hold [2024-11-13 20:42:54,094 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,094 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,094 INFO L77 FloydHoareUtils]: At program point L762(lines 762 767) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (let ((.cse2 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse3 (= |~#global_list_13~0.offset| 0)) (.cse0 (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|)) (.cse1 (select .cse4 |~#global_list_13~0.offset|))) (or (and (= (select .cse0 0) 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= .cse1 |~#global_list_13~0.base|) .cse2 (= 8 (select |#length| 2)) .cse3 (= 2 (select .cse4 0))) (let ((.cse7 (select |#memory_$Pointer$.offset| .cse1)) (.cse5 (select |#memory_$Pointer$.base| .cse1)) (.cse6 (select .cse0 |~#global_list_13~0.offset|))) (and (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| .cse1 0)) (= |~#global_list_13~0.base| (select .cse5 8)) (<= (+ .cse1 1) |#StackHeapBarrier|) (= .cse6 4) .cse2 (= (select |#valid| .cse1) 1) (= (select |#length| |~#global_list_13~0.base|) 8) (= (select .cse7 8) |~#global_list_13~0.offset|) (= |~#global_list_13~0.offset| (select .cse7 .cse6)) (= |~#global_list_13~0.base| (select .cse5 .cse6)) .cse3 (<= (+ .cse6 8) (select |#length| .cse1))))))) [2024-11-13 20:42:54,095 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,095 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,095 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,095 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,095 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,095 INFO L77 FloydHoareUtils]: At program point L548(line 548) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|) |ULTIMATE.start___ldv_list_add_~new#1.offset|))) (and (= (select |#valid| |ULTIMATE.start___ldv_list_add_~new#1.base|) 1) (<= (+ 1 |ULTIMATE.start___ldv_list_add_~new#1.base|) |#StackHeapBarrier|) (= |ULTIMATE.start___ldv_list_add_~new#1.offset| 4) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| .cse0)) (<= 0 |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= .cse0 |~#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|) (<= (+ |ULTIMATE.start___ldv_list_add_~new#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|)))) [2024-11-13 20:42:54,096 INFO L77 FloydHoareUtils]: At program point L771(line 771) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (let ((.cse2 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse3 (= |~#global_list_13~0.offset| 0)) (.cse0 (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|)) (.cse1 (select .cse4 |~#global_list_13~0.offset|))) (or (and (= (select .cse0 0) 0) (= |ULTIMATE.start_main_old_#valid#1| |#valid|) (= .cse1 |~#global_list_13~0.base|) .cse2 (= 8 (select |#length| 2)) .cse3 (= 2 (select .cse4 0))) (let ((.cse7 (select |#memory_$Pointer$.offset| .cse1)) (.cse5 (select |#memory_$Pointer$.base| .cse1)) (.cse6 (select .cse0 |~#global_list_13~0.offset|))) (and (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| .cse1 0)) (= |~#global_list_13~0.base| (select .cse5 8)) (<= (+ .cse1 1) |#StackHeapBarrier|) (= .cse6 4) .cse2 (= (select |#valid| .cse1) 1) (= (select |#length| |~#global_list_13~0.base|) 8) (= (select .cse7 8) |~#global_list_13~0.offset|) (= |~#global_list_13~0.offset| (select .cse7 .cse6)) (= |~#global_list_13~0.base| (select .cse5 .cse6)) .cse3 (<= (+ .cse6 8) (select |#length| .cse1))))))) [2024-11-13 20:42:54,096 INFO L77 FloydHoareUtils]: At program point L771-2(line 771) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|)) (.cse4 (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1)) (.cse5 (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (or (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|))) (let ((.cse1 (select .cse3 8)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select .cse0 8) |~#global_list_13~0.offset|) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| .cse1)) (= .cse1 |~#global_list_13~0.base|) (= (store |#valid| |ULTIMATE.start_free_13_~p~1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 0 |~#global_list_13~0.offset|) (not .cse2) (= (select .cse3 4) |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) .cse4 (= |~#global_list_13~0.offset| (select .cse0 .cse5)) (<= (+ 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) (<= |~#global_list_13~0.offset| 0)))) (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) .cse2 .cse4 (= 2 |~#global_list_13~0.base|) (= 8 (select |#length| 2)) (= .cse5 |~#global_list_13~0.offset|) (= |~#global_list_13~0.offset| 0)))) [2024-11-13 20:42:54,096 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,096 INFO L77 FloydHoareUtils]: At program point L771-6(line 771) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= .cse0 |~#global_list_13~0.offset|) (= (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 .cse0) (= (+ |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-11-13 20:42:54,096 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK(lines 781 783) no Hoare annotation was computed. [2024-11-13 20:42:54,096 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-11-13 20:42:54,100 INFO L77 FloydHoareUtils]: At program point L771-8(lines 771 774) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_free_13_~p~1#1.base| |~#global_list_13~0.base|)) (.cse1 (= (select |#valid| |~#global_list_13~0.base|) 1)) (.cse2 (+ |ULTIMATE.start_free_13_~p~1#1.offset| 4))) (or (and (= |ULTIMATE.start_main_old_#valid#1| |#valid|) .cse0 .cse1 (<= 0 .cse2) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= .cse2 |~#global_list_13~0.offset|)) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|))) (let ((.cse6 (select .cse3 .cse2)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|)) (.cse4 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select .cse3 8) |~#global_list_13~0.offset|) (= .cse4 |~#global_list_13~0.offset|) (= (select .cse5 8) |~#global_list_13~0.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| |~#global_list_13~0.base|) (not .cse0) .cse1 (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= (select .cse5 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) (<= 0 .cse6) (<= (+ 8 .cse6) (select |#length| (select .cse5 .cse2))) (= (select .cse3 4) .cse4) (<= |~#global_list_13~0.offset| 0)))))) [2024-11-13 20:42:54,100 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-11-13 20:42:54,100 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,100 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,101 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,101 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,101 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,101 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-11-13 20:42:54,101 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,101 INFO L77 FloydHoareUtils]: At program point L549(line 549) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start___ldv_list_add_~new#1.base|))) (let ((.cse1 (select .cse0 8))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start___ldv_list_add_~new#1.base|)) (.cse3 (select |#length| .cse1))) (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) (<= 0 |ULTIMATE.start___ldv_list_add_~prev#1.offset|) (= (select .cse0 |ULTIMATE.start___ldv_list_add_~new#1.offset|) |~#global_list_13~0.base|) (= .cse1 |~#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|) (= (select .cse2 8) |~#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 .cse2 |ULTIMATE.start___ldv_list_add_~new#1.offset|)) (<= (+ 8 |~#global_list_13~0.offset|) .cse3) (= .cse3 8) (= |ULTIMATE.start___ldv_list_add_~prev#1.base| |~#global_list_13~0.base|) (<= (+ |ULTIMATE.start___ldv_list_add_~new#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_add_~new#1.base|)))))) [2024-11-13 20:42:54,102 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 20:42:54,102 INFO L77 FloydHoareUtils]: At program point L764(lines 764 766) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_alloc_13_~p~0#1.base| 0)) (.cse3 (= |ULTIMATE.start_alloc_13_~p~0#1.offset| 0))) (let ((.cse0 (and .cse1 .cse3)) (.cse2 (select |#memory_$Pointer$.base| |~#global_list_13~0.base|))) (and (or (= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) 1) .cse0) (<= (+ |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 .cse1)) (= (select .cse2 |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (select |#valid| |~#global_list_13~0.base|) 1) (or .cse0 (and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) 12) .cse3)) (= (select |#length| |~#global_list_13~0.base|) 8) (or .cse0 (= (store |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (= |~#global_list_13~0.offset| 0) (= 2 (select .cse2 0))))) [2024-11-13 20:42:54,104 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,104 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,104 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,104 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,104 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,104 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,104 INFO L77 FloydHoareUtils]: At program point L781(lines 781 783) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 20:42:54,105 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (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|) (= .cse0 |~#global_list_13~0.offset|) (= (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_~prev#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= .cse0 |ULTIMATE.start___ldv_list_del_~next#1.offset|) (<= 0 |ULTIMATE.start___ldv_list_del_~prev#1.offset|) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-13 20:42:54,105 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 20:42:54,105 INFO L77 FloydHoareUtils]: At program point L554-1(line 554) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (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|) (= .cse0 |~#global_list_13~0.offset|) (= (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_~prev#1.offset| 8) (select |#length| |ULTIMATE.start___ldv_list_del_~prev#1.base|)) (= (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|) 1) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (= .cse0 |ULTIMATE.start___ldv_list_del_~next#1.offset|) (<= 0 |ULTIMATE.start___ldv_list_del_~prev#1.offset|) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-13 20:42:54,105 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,105 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|) (= .cse0 |~#global_list_13~0.offset|) (= (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|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-13 20:42:54,106 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-11-13 20:42:54,106 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|) (= .cse0 |~#global_list_13~0.offset|) (= (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|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-13 20:42:54,106 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 (= .cse0 |~#global_list_13~0.offset|) (= (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|)) (<= |~#global_list_13~0.offset| 0))) [2024-11-13 20:42:54,106 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 773) no Hoare annotation was computed. [2024-11-13 20:42:54,106 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,107 INFO L77 FloydHoareUtils]: At program point L567(line 567) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|))) (let ((.cse2 (select .cse4 |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_list_del_~entry#1.base|) 8)) (.cse3 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4)) (.cse1 (select .cse4 8))) (and (<= (+ .cse0 8) (select |#length| .cse1)) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| .cse2) 1) (= .cse3 |~#global_list_13~0.offset|) (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|) (not (= |ULTIMATE.start_free_13_~p~1#1.base| .cse2)) (= (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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|) 4) |ULTIMATE.start_free_13_~n~1#1.base|) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= 0 .cse3) (<= 0 .cse0) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|) 4) .cse3) (<= |~#global_list_13~0.offset| 0) (= (select |#valid| .cse1) 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-11-13 20:42:54,107 INFO L77 FloydHoareUtils]: At program point L567-1(line 567) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|) |ULTIMATE.start_ldv_list_del_~entry#1.offset|)) (.cse1 (+ |ULTIMATE.start_free_13_~n~1#1.offset| 4))) (and (= (select |#valid| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|) 1) (<= (+ |ULTIMATE.start_free_13_~p~1#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| .cse0) 1) (<= (+ |ULTIMATE.start_ldv_list_del_#t~mem16#1.offset| 8) (select |#length| |ULTIMATE.start_ldv_list_del_#t~mem16#1.base|)) (= .cse1 |~#global_list_13~0.offset|) (= |ULTIMATE.start_free_13_~p~1#1.base| |ULTIMATE.start_ldv_list_del_~entry#1.base|) (not (= |ULTIMATE.start_free_13_~p~1#1.base| .cse0)) (= (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) (<= 0 |ULTIMATE.start_ldv_list_del_#t~mem16#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_13_~p~1#1.base|) 4) |ULTIMATE.start_free_13_~n~1#1.base|) (= |ULTIMATE.start_free_13_~p~1#1.offset| 0) (<= 0 .cse1) (<= (+ 8 |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_13_~p~1#1.base|) 4) .cse1) (<= |~#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-11-13 20:42:54,107 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,107 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,107 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,107 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,108 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-11-13 20:42:54,108 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,108 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:42:54,108 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-11-13 20:42:54,108 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-11-13 20:42:54,121 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:42:54,122 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:42:54,123 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-11-13 20:42:54,123 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-11-13 20:42:54,123 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:42:54,123 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:42:54,124 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-11-13 20:42:54,127 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-13 20:42:54,127 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:42:54,127 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:42:54,127 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-11-13 20:42:54,128 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-13 20:42:54,128 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-11-13 20:42:54,128 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 20:42:54,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-13 20:42:54,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-13 20:42:54,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-13 20:42:54,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-13 20:42:54,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!offset [2024-11-13 20:42:54,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-13 20:42:54,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 20:42:54,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 20:42:54,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-13 20:42:54,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-11-13 20:42:54,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 20:42:54,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!base [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!base [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:42:54,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!base [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:42:54,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~1!offset [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:42:54,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:42:54,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-13 20:42:54,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-13 20:42:54,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] [2024-11-13 20:42:54,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~1!offset [2024-11-13 20:42:54,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset [2024-11-13 20:42:54,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:42:54 ImpRootNode [2024-11-13 20:42:54,136 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:42:54,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:42:54,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:42:54,136 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:42:54,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:34:23" (3/4) ... [2024-11-13 20:42:54,140 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 20:42:54,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-13 20:42:54,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-13 20:42:54,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 20:42:54,260 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:42:54,260 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 20:42:54,260 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:42:54,261 INFO L158 Benchmark]: Toolchain (without parser) took 512425.90ms. Allocated memory was 109.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 82.5MB in the beginning and 893.8MB in the end (delta: -811.3MB). Peak memory consumption was 971.8MB. Max. memory is 16.1GB. [2024-11-13 20:42:54,261 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:42:54,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.21ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 59.6MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:42:54,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.85ms. Allocated memory is still 109.1MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:42:54,262 INFO L158 Benchmark]: Boogie Preprocessor took 53.73ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 56.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:42:54,262 INFO L158 Benchmark]: RCFGBuilder took 858.05ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 74.6MB in the end (delta: -18.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-13 20:42:54,263 INFO L158 Benchmark]: CodeCheck took 510592.20ms. Allocated memory was 109.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 74.6MB in the beginning and 897.9MB in the end (delta: -823.3MB). Peak memory consumption was 966.6MB. Max. memory is 16.1GB. [2024-11-13 20:42:54,263 INFO L158 Benchmark]: Witness Printer took 124.04ms. Allocated memory is still 1.9GB. Free memory was 897.9MB in the beginning and 893.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:42:54,265 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: 505.2s, OverallIterations: 75, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12307 SdHoareTripleChecker+Valid, 131.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11489 mSDsluCounter, 3952 SdHoareTripleChecker+Invalid, 116.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3628 mSDsCounter, 14338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62515 IncrementalHoareTripleChecker+Invalid, 76853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14338 mSolverCounterUnsat, 324 mSDtfsCounter, 62515 mSolverCounterSat, 1.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9976 GetRequests, 8355 SyntacticMatches, 355 SemanticMatches, 1266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807363 ImplicationChecksByTransitivity, 482.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 93.4s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 847 ConstructedInterpolants, 0 QuantifiedInterpolants, 10582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 74 InterpolantComputations, 69 PerfectInterpolantSequences, 8/15 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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.36ms. Allocated memory is still 83.9MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.21ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 59.6MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.85ms. Allocated memory is still 109.1MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.73ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 56.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 858.05ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 74.6MB in the end (delta: -18.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * CodeCheck took 510592.20ms. Allocated memory was 109.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 74.6MB in the beginning and 897.9MB in the end (delta: -823.3MB). Peak memory consumption was 966.6MB. Max. memory is 16.1GB. * Witness Printer took 124.04ms. Allocated memory is still 1.9GB. Free memory was 897.9MB in the beginning and 893.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~1!offset - 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$.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: ~n~1!offset - 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: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!base - 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: #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: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~p~1!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#global_list_13~0!offset RESULT: Ultimate proved your program to be correct! [2024-11-13 20:42:54,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f6f835-63e9-4b01-b90b-4f1ac6d60146/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE