./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:28:45,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:28:45,162 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-08 19:28:45,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:28:45,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:28:45,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:28:45,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:28:45,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:28:45,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:28:45,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:28:45,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:28:45,215 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:28:45,216 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:28:45,216 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:28:45,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:28:45,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:28:45,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:28:45,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:28:45,222 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:28:45,223 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:28:45,223 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:28:45,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:28:45,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:28:45,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:28:45,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:28:45,228 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:28:45,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:28:45,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 [2024-11-08 19:28:45,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:28:45,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:28:45,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:28:45,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:28:45,578 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:28:45,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i Unable to find full path for "g++" [2024-11-08 19:28:48,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:28:48,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:28:48,507 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2024-11-08 19:28:48,521 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/data/27fa2c36a/b553847f8eee46cbba04af4231dca2f5/FLAGb0704e4d2 [2024-11-08 19:28:48,793 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/data/27fa2c36a/b553847f8eee46cbba04af4231dca2f5 [2024-11-08 19:28:48,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:28:48,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:28:48,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:28:48,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:28:48,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:28:48,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:28:48" (1/1) ... [2024-11-08 19:28:48,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afce89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:48, skipping insertion in model container [2024-11-08 19:28:48,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:28:48" (1/1) ... [2024-11-08 19:28:48,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:28:49,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:28:49,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:28:49,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:28:49,375 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:28:49,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49 WrapperNode [2024-11-08 19:28:49,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:28:49,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:28:49,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:28:49,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:28:49,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,421 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-11-08 19:28:49,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:28:49,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:28:49,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:28:49,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:28:49,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:28:49,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:28:49,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:28:49,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:28:49,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:49,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:28:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:28:49,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:28:49,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:28:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:28:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:28:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:28:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:28:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:28:49,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:28:49,665 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:28:49,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:28:49,919 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-08 19:28:49,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:28:49,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:28:49,994 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:28:49,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:28:49 BoogieIcfgContainer [2024-11-08 19:28:49,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:28:49,996 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:28:49,997 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:28:50,008 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:28:50,008 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:28:49" (1/1) ... [2024-11-08 19:28:50,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:28:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 45 states and 47 transitions. [2024-11-08 19:28:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2024-11-08 19:28:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 19:28:50,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 44 states and 46 transitions. [2024-11-08 19:28:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-11-08 19:28:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 19:28:50,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 43 states and 45 transitions. [2024-11-08 19:28:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2024-11-08 19:28:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 19:28:51,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 42 states and 44 transitions. [2024-11-08 19:28:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-11-08 19:28:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 19:28:51,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 41 states and 43 transitions. [2024-11-08 19:28:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-08 19:28:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 19:28:51,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 40 states and 42 transitions. [2024-11-08 19:28:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-11-08 19:28:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 19:28:52,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 39 states and 41 transitions. [2024-11-08 19:28:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-08 19:28:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:28:52,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 38 states and 40 transitions. [2024-11-08 19:28:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-08 19:28:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:28:53,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 37 states and 39 transitions. [2024-11-08 19:28:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-08 19:28:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 19:28:54,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 38 states and 40 transitions. [2024-11-08 19:28:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-08 19:28:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 19:28:55,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-08 19:28:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-08 19:28:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:28:56,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 41 states and 46 transitions. [2024-11-08 19:28:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-08 19:28:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:28:56,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 43 states and 50 transitions. [2024-11-08 19:28:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-11-08 19:28:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:28:57,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 46 states and 56 transitions. [2024-11-08 19:28:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-08 19:28:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:28:58,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 50 states and 64 transitions. [2024-11-08 19:28:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-11-08 19:28:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:28:58,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 55 states and 77 transitions. [2024-11-08 19:28:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2024-11-08 19:28:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:28:59,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 60 states and 90 transitions. [2024-11-08 19:28:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-08 19:28:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:28:59,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 61 states and 91 transitions. [2024-11-08 19:29:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2024-11-08 19:29:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:29:00,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 63 states and 96 transitions. [2024-11-08 19:29:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-11-08 19:29:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:29:00,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 66 states and 106 transitions. [2024-11-08 19:29:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 106 transitions. [2024-11-08 19:29:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:29:00,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:00,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 72 states and 122 transitions. [2024-11-08 19:29:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 122 transitions. [2024-11-08 19:29:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:29:04,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 74 states and 126 transitions. [2024-11-08 19:29:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 126 transitions. [2024-11-08 19:29:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:29:05,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 79 states and 142 transitions. [2024-11-08 19:29:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 142 transitions. [2024-11-08 19:29:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:29:07,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 85 states and 159 transitions. [2024-11-08 19:29:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 159 transitions. [2024-11-08 19:29:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:29:09,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 87 states and 161 transitions. [2024-11-08 19:29:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 161 transitions. [2024-11-08 19:29:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:29:09,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:11,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-08 19:29:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 92 states and 171 transitions. [2024-11-08 19:29:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2024-11-08 19:29:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:29:15,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 93 states and 173 transitions. [2024-11-08 19:29:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2024-11-08 19:29:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:29:15,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:15,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-08 19:29:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 93 states and 172 transitions. [2024-11-08 19:29:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 172 transitions. [2024-11-08 19:29:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:29:15,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 97 states and 181 transitions. [2024-11-08 19:29:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 181 transitions. [2024-11-08 19:29:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:29:16,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 102 states and 192 transitions. [2024-11-08 19:29:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 192 transitions. [2024-11-08 19:29:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:29:17,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 101 states and 191 transitions. [2024-11-08 19:29:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 191 transitions. [2024-11-08 19:29:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:29:17,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 102 states and 195 transitions. [2024-11-08 19:29:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 195 transitions. [2024-11-08 19:29:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:29:17,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:29:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 102 states and 194 transitions. [2024-11-08 19:29:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 194 transitions. [2024-11-08 19:29:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:29:18,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:29:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 104 states and 195 transitions. [2024-11-08 19:29:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 195 transitions. [2024-11-08 19:29:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:29:18,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:29:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 108 states and 200 transitions. [2024-11-08 19:29:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 200 transitions. [2024-11-08 19:29:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:29:18,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:29:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 113 states and 206 transitions. [2024-11-08 19:29:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 206 transitions. [2024-11-08 19:29:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:29:19,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 117 states and 211 transitions. [2024-11-08 19:29:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 211 transitions. [2024-11-08 19:29:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:29:19,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 121 states and 214 transitions. [2024-11-08 19:29:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 214 transitions. [2024-11-08 19:29:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:29:20,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 128 states and 221 transitions. [2024-11-08 19:29:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 221 transitions. [2024-11-08 19:29:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:29:23,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:29:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 130 states and 223 transitions. [2024-11-08 19:29:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 223 transitions. [2024-11-08 19:29:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:29:23,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:29:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 135 states and 238 transitions. [2024-11-08 19:29:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 238 transitions. [2024-11-08 19:29:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:29:27,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:27,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:29:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 134 states and 235 transitions. [2024-11-08 19:29:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 235 transitions. [2024-11-08 19:29:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:29:28,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:29:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 136 states and 237 transitions. [2024-11-08 19:29:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 237 transitions. [2024-11-08 19:29:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:29:29,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:29:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 137 states and 237 transitions. [2024-11-08 19:29:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 237 transitions. [2024-11-08 19:29:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:29:30,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:30,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 19:29:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 136 states and 236 transitions. [2024-11-08 19:29:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 236 transitions. [2024-11-08 19:29:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:29:30,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:29:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 149 states and 256 transitions. [2024-11-08 19:29:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 256 transitions. [2024-11-08 19:29:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:29:36,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 19:29:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 148 states and 255 transitions. [2024-11-08 19:29:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 255 transitions. [2024-11-08 19:29:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:29:36,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 19:29:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 151 states and 261 transitions. [2024-11-08 19:29:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 261 transitions. [2024-11-08 19:29:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:29:38,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 19:29:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 155 states and 269 transitions. [2024-11-08 19:29:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 269 transitions. [2024-11-08 19:29:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:29:40,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:29:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 156 states and 270 transitions. [2024-11-08 19:29:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 270 transitions. [2024-11-08 19:29:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:29:40,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:29:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 162 states and 279 transitions. [2024-11-08 19:29:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 279 transitions. [2024-11-08 19:29:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:29:42,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 19:29:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 167 states and 286 transitions. [2024-11-08 19:29:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 286 transitions. [2024-11-08 19:29:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:29:44,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 19:29:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 166 states and 284 transitions. [2024-11-08 19:29:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 284 transitions. [2024-11-08 19:29:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:29:45,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 19:29:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 167 states and 284 transitions. [2024-11-08 19:29:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 284 transitions. [2024-11-08 19:29:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:29:45,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:45,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 19:29:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 172 states and 290 transitions. [2024-11-08 19:29:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 290 transitions. [2024-11-08 19:29:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:29:46,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:46,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 19:29:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 177 states and 294 transitions. [2024-11-08 19:29:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2024-11-08 19:29:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:29:46,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 19:29:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 183 states and 299 transitions. [2024-11-08 19:29:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 299 transitions. [2024-11-08 19:29:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:29:50,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 19:29:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 182 states and 296 transitions. [2024-11-08 19:29:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 296 transitions. [2024-11-08 19:29:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 19:29:51,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:51,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:29:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 47 states and 61 transitions. [2024-11-08 19:29:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-11-08 19:29:52,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:29:52,280 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 59 iterations. [2024-11-08 19:29:52,288 INFO L729 CodeCheckObserver]: All specifications hold 27 specifications checked. All of them hold [2024-11-08 19:29:55,848 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,848 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,848 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,849 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 563 565) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 19:29:55,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,851 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,851 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,852 INFO L77 FloydHoareUtils]: At program point L557-3(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,852 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,853 INFO L77 FloydHoareUtils]: At program point L557-4(line 557) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,854 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,854 INFO L77 FloydHoareUtils]: At program point L557-7(lines 557 560) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse8 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) .cse1 .cse2 .cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse4 .cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse6 .cse7 .cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) .cse9) (and .cse0 (not |ULTIMATE.start_test_fun_#t~short10#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2024-11-08 19:29:55,855 INFO L77 FloydHoareUtils]: At program point L557-9(lines 557 560) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,855 INFO L77 FloydHoareUtils]: At program point L557-10(lines 557 560) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:29:55,855 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 19:29:55,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,857 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,858 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,858 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,858 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 19:29:55,859 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,859 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,859 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,859 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,859 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,860 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:29:55,860 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,861 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,861 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK(lines 563 565) no Hoare annotation was computed. [2024-11-08 19:29:55,861 INFO L77 FloydHoareUtils]: At program point L555(line 555) the Hoare annotation is: (let ((.cse0 (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:29:55,869 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:29:55,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:29:55,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:29:55,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:29:55,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:29:55,873 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:29:55,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:29:55,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:29:55,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:29:55,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:29:55,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:29:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:29:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 19:29:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:29:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:29:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-08 19:29:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:29:55,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 19:29:55,876 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:29:55,876 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:29:55,876 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:29:55,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:29:55 ImpRootNode [2024-11-08 19:29:55,879 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:29:55,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:29:55,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:29:55,880 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:29:55,880 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:28:49" (3/4) ... [2024-11-08 19:29:55,882 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:29:55,890 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-08 19:29:55,890 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 19:29:55,890 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 19:29:55,890 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 19:29:56,010 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:29:56,011 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 19:29:56,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:29:56,012 INFO L158 Benchmark]: Toolchain (without parser) took 67213.31ms. Allocated memory was 127.9MB in the beginning and 851.4MB in the end (delta: 723.5MB). Free memory was 86.0MB in the beginning and 661.8MB in the end (delta: -575.8MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2024-11-08 19:29:56,012 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 127.9MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:29:56,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.99ms. Allocated memory is still 127.9MB. Free memory was 85.6MB in the beginning and 67.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:29:56,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.76ms. Allocated memory is still 127.9MB. Free memory was 67.1MB in the beginning and 65.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:29:56,013 INFO L158 Benchmark]: Boogie Preprocessor took 26.22ms. Allocated memory is still 127.9MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:29:56,013 INFO L158 Benchmark]: RCFGBuilder took 545.93ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 63.7MB in the beginning and 118.1MB in the end (delta: -54.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-08 19:29:56,015 INFO L158 Benchmark]: CodeCheck took 65883.06ms. Allocated memory was 161.5MB in the beginning and 851.4MB in the end (delta: 690.0MB). Free memory was 118.1MB in the beginning and 667.0MB in the end (delta: -548.9MB). Peak memory consumption was 142.1MB. Max. memory is 16.1GB. [2024-11-08 19:29:56,016 INFO L158 Benchmark]: Witness Printer took 131.19ms. Allocated memory is still 851.4MB. Free memory was 667.0MB in the beginning and 661.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:29:56,018 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, 45 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 62.2s, OverallIterations: 59, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14361 SdHoareTripleChecker+Valid, 63.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13709 mSDsluCounter, 5146 SdHoareTripleChecker+Invalid, 55.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4396 mSDsCounter, 3190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34723 IncrementalHoareTripleChecker+Invalid, 37913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3190 mSolverCounterUnsat, 750 mSDtfsCounter, 34723 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8042 GetRequests, 7165 SyntacticMatches, 413 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117162 ImplicationChecksByTransitivity, 51.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 869 ConstructedInterpolants, 0 QuantifiedInterpolants, 11406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 55 PerfectInterpolantSequences, 258/266 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 127.9MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.99ms. Allocated memory is still 127.9MB. Free memory was 85.6MB in the beginning and 67.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.76ms. Allocated memory is still 127.9MB. Free memory was 67.1MB in the beginning and 65.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.22ms. Allocated memory is still 127.9MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 545.93ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 63.7MB in the beginning and 118.1MB in the end (delta: -54.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * CodeCheck took 65883.06ms. Allocated memory was 161.5MB in the beginning and 851.4MB in the end (delta: 690.0MB). Free memory was 118.1MB in the beginning and 667.0MB in the end (delta: -548.9MB). Peak memory consumption was 142.1MB. Max. memory is 16.1GB. * Witness Printer took 131.19ms. Allocated memory is still 851.4MB. Free memory was 667.0MB in the beginning and 661.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-11-08 19:29:56,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f6747b3-c335-4e79-b952-fa67e3511021/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE