./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/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_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/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_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/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 93cff60adb183fef3af5f3af7541e684acb33c49f5e09dc255d0e19d271c8517 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:40:48,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:40:48,949 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-09 00:40:48,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:40:48,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:40:48,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:40:48,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:40:48,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:40:48,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:40:48,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:40:48,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:40:48,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 00:40:48,982 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 00:40:48,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 00:40:48,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:40:48,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:40:48,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:40:48,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:40:48,984 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:40:48,985 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:40:48,985 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:40:48,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:40:48,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:40:48,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:40:48,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:40:48,987 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:40:48,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:40:48,988 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_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/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_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/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 -> 93cff60adb183fef3af5f3af7541e684acb33c49f5e09dc255d0e19d271c8517 [2024-11-09 00:40:49,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:40:49,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:40:49,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:40:49,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:40:49,271 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:40:49,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i Unable to find full path for "g++" [2024-11-09 00:40:51,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:40:51,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:40:51,616 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2024-11-09 00:40:51,635 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/data/0893005de/f48a7e68f73346b681e38f9219ff6264/FLAGc029e37a1 [2024-11-09 00:40:51,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/data/0893005de/f48a7e68f73346b681e38f9219ff6264 [2024-11-09 00:40:51,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:40:51,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:40:51,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:40:51,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:40:51,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:40:51,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:40:51" (1/1) ... [2024-11-09 00:40:51,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2e66dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:51, skipping insertion in model container [2024-11-09 00:40:51,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:40:51" (1/1) ... [2024-11-09 00:40:51,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:40:52,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:40:52,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:40:52,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:40:52,476 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:40:52,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52 WrapperNode [2024-11-09 00:40:52,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:40:52,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:40:52,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:40:52,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:40:52,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,528 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-09 00:40:52,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:40:52,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:40:52,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:40:52,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:40:52,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:40:52,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:40:52,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:40:52,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:40:52,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:40:52" (1/1) ... [2024-11-09 00:40:52,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:40:52,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:40:52,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:40:52,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:40:52,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:40:52,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:40:52,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:40:52,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:40:52,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:40:52,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:40:52,816 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:40:52,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:40:53,182 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-09 00:40:53,182 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:40:53,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:40:53,249 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 00:40:53,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:40:53 BoogieIcfgContainer [2024-11-09 00:40:53,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:40:53,251 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:40:53,251 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:40:53,265 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:40:53,266 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:40:53" (1/1) ... [2024-11-09 00:40:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:40:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 45 states and 48 transitions. [2024-11-09 00:40:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-09 00:40:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:40:53,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:54,001 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-09 00:40:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 44 states and 47 transitions. [2024-11-09 00:40:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-09 00:40:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:40:54,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:54,395 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-09 00:40:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 43 states and 46 transitions. [2024-11-09 00:40:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-09 00:40:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:40:54,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:54,718 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-09 00:40:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-09 00:40:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-09 00:40:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:40:54,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:55,101 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-09 00:40:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2024-11-09 00:40:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-09 00:40:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:40:55,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:55,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:55,563 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-09 00:40:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 40 states and 43 transitions. [2024-11-09 00:40:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-09 00:40:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:40:55,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:56,217 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-09 00:40:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 39 states and 42 transitions. [2024-11-09 00:40:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-09 00:40:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:40:56,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:57,135 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-09 00:40:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 38 states and 41 transitions. [2024-11-09 00:40:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-09 00:40:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:40:58,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:58,183 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-09 00:40:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 37 states and 40 transitions. [2024-11-09 00:40:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 00:40:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:40:59,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:59,447 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-09 00:41:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 36 states and 38 transitions. [2024-11-09 00:41:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-09 00:41:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:41:00,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 37 states and 40 transitions. [2024-11-09 00:41:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 00:41:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:41:01,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:01,304 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-09 00:41:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 39 states and 44 transitions. [2024-11-09 00:41:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-09 00:41:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:41:01,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:01,938 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-09 00:41:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 41 states and 48 transitions. [2024-11-09 00:41:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-09 00:41:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:41:02,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:02,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-09 00:41:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 45 states and 56 transitions. [2024-11-09 00:41:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-11-09 00:41:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:41:03,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:03,124 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-09 00:41:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 49 states and 64 transitions. [2024-11-09 00:41:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-09 00:41:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:41:03,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 53 states and 73 transitions. [2024-11-09 00:41:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2024-11-09 00:41:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:41:04,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 57 states and 84 transitions. [2024-11-09 00:41:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-11-09 00:41:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:41:05,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:06,219 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-09 00:41:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 62 states and 96 transitions. [2024-11-09 00:41:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 96 transitions. [2024-11-09 00:41:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:41:08,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:08,808 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-09 00:41:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 64 states and 103 transitions. [2024-11-09 00:41:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 103 transitions. [2024-11-09 00:41:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:41:09,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:09,441 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-09 00:41:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 67 states and 112 transitions. [2024-11-09 00:41:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 112 transitions. [2024-11-09 00:41:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:41:09,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:09,845 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-09 00:41:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 71 states and 123 transitions. [2024-11-09 00:41:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 123 transitions. [2024-11-09 00:41:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:41:11,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:11,300 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-09 00:41:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 75 states and 133 transitions. [2024-11-09 00:41:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 133 transitions. [2024-11-09 00:41:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:41:13,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:13,483 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-09 00:41:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 77 states and 139 transitions. [2024-11-09 00:41:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 139 transitions. [2024-11-09 00:41:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:41:14,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:14,331 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-09 00:41:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 80 states and 146 transitions. [2024-11-09 00:41:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 146 transitions. [2024-11-09 00:41:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:41:14,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:14,962 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-09 00:41:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 79 states and 145 transitions. [2024-11-09 00:41:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 145 transitions. [2024-11-09 00:41:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:41:15,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:15,063 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-09 00:41:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 86 states and 160 transitions. [2024-11-09 00:41:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 160 transitions. [2024-11-09 00:41:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:41:16,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:16,460 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-09 00:41:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 87 states and 161 transitions. [2024-11-09 00:41:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 161 transitions. [2024-11-09 00:41:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:41:16,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:16,547 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-09 00:41:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 87 states and 160 transitions. [2024-11-09 00:41:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 160 transitions. [2024-11-09 00:41:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:41:16,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:16,779 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-09 00:41:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 89 states and 163 transitions. [2024-11-09 00:41:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 163 transitions. [2024-11-09 00:41:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:41:16,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:16,894 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-09 00:41:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 92 states and 168 transitions. [2024-11-09 00:41:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 168 transitions. [2024-11-09 00:41:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:41:16,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:17,024 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-09 00:41:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 94 states and 173 transitions. [2024-11-09 00:41:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2024-11-09 00:41:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:41:17,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:17,442 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-09 00:41:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 96 states and 177 transitions. [2024-11-09 00:41:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2024-11-09 00:41:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:41:17,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:17,761 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-09 00:41:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 98 states and 182 transitions. [2024-11-09 00:41:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 182 transitions. [2024-11-09 00:41:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:41:18,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:18,252 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-09 00:41:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 100 states and 185 transitions. [2024-11-09 00:41:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2024-11-09 00:41:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:41:18,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 105 states and 191 transitions. [2024-11-09 00:41:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 191 transitions. [2024-11-09 00:41:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:41:18,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 110 states and 197 transitions. [2024-11-09 00:41:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 197 transitions. [2024-11-09 00:41:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:41:18,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:18,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 112 states and 200 transitions. [2024-11-09 00:41:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2024-11-09 00:41:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:41:19,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 114 states and 201 transitions. [2024-11-09 00:41:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 201 transitions. [2024-11-09 00:41:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:41:19,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 119 states and 207 transitions. [2024-11-09 00:41:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2024-11-09 00:41:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:41:20,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 118 states and 206 transitions. [2024-11-09 00:41:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2024-11-09 00:41:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:41:20,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:20,558 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-09 00:41:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 120 states and 207 transitions. [2024-11-09 00:41:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 207 transitions. [2024-11-09 00:41:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:41:20,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:20,699 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-09 00:41:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 122 states and 208 transitions. [2024-11-09 00:41:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 208 transitions. [2024-11-09 00:41:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:41:20,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:20,902 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-09 00:41:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 124 states and 209 transitions. [2024-11-09 00:41:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 209 transitions. [2024-11-09 00:41:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:41:21,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:41:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 18 states and 19 transitions. [2024-11-09 00:41:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-09 00:41:23,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:41:23,155 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 44 iterations. [2024-11-09 00:41:23,168 INFO L729 CodeCheckObserver]: All specifications hold 27 specifications checked. All of them hold [2024-11-09 00:41:23,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,851 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,851 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,851 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,851 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 565 567) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:41:23,851 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,852 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,852 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,852 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,853 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,853 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,854 INFO L77 FloydHoareUtils]: At program point L561(line 561) 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) (= |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|) (<= 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-09 00:41:23,854 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,855 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) (= |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|) (<= 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-09 00:41:23,855 INFO L77 FloydHoareUtils]: At program point L557-1(lines 557 562) 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) (= |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|) (<= 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-09 00:41:23,856 INFO L77 FloydHoareUtils]: At program point L557-3(lines 557 562) 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) (= |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|) (<= 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-09 00:41:23,856 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_#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|) (<= 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-09 00:41:23,857 INFO L77 FloydHoareUtils]: At program point L557-4(lines 557 562) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~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-09 00:41:23,857 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_#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|) (<= 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-09 00:41:23,857 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:41:23,858 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,858 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,858 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,858 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,858 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,859 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,859 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) (= |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|) (<= 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-09 00:41:23,860 INFO L77 FloydHoareUtils]: At program point L558-2(lines 558 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) (= |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|) (<= 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-09 00:41:23,860 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_#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|) (<= 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-09 00:41:23,861 INFO L77 FloydHoareUtils]: At program point L558-4(lines 558 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) (= |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|) (<= 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-09 00:41:23,861 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:41:23,862 INFO L77 FloydHoareUtils]: At program point L558-5(lines 558 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) (= |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|) (<= 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-09 00:41:23,862 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,862 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,862 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,863 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,863 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,863 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:41:23,863 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) (= |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|) (<= 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-09 00:41:23,864 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) (= |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|) (<= 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-09 00:41:23,864 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK(lines 565 567) no Hoare annotation was computed. [2024-11-09 00:41:23,865 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_#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|) (<= 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-09 00:41:23,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:41:23,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:41:23,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-09 00:41:23,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-09 00:41:23,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:41:23,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 00:41:23,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-09 00:41:23,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-09 00:41:23,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-09 00:41:23,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-09 00:41:23,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-09 00:41:23,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-09 00:41:23,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-09 00:41:23,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-09 00:41:23,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-09 00:41:23,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-09 00:41:23,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-09 00:41:23,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 00:41:23,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:41:23,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 00:41:23,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 00:41:23,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:41:23 ImpRootNode [2024-11-09 00:41:23,888 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:41:23,889 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:41:23,889 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:41:23,889 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:41:23,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:40:53" (3/4) ... [2024-11-09 00:41:23,894 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:41:23,906 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 00:41:23,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:41:23,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:41:23,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:41:24,039 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:41:24,040 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:41:24,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:41:24,041 INFO L158 Benchmark]: Toolchain (without parser) took 32115.85ms. Allocated memory was 127.9MB in the beginning and 339.7MB in the end (delta: 211.8MB). Free memory was 89.1MB in the beginning and 106.7MB in the end (delta: -17.6MB). Peak memory consumption was 196.3MB. Max. memory is 16.1GB. [2024-11-09 00:41:24,041 INFO L158 Benchmark]: CDTParser took 3.90ms. Allocated memory is still 127.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:41:24,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.99ms. Allocated memory is still 127.9MB. Free memory was 88.7MB in the beginning and 70.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:41:24,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.10ms. Allocated memory is still 127.9MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:41:24,043 INFO L158 Benchmark]: Boogie Preprocessor took 51.29ms. Allocated memory is still 127.9MB. Free memory was 68.1MB in the beginning and 67.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:41:24,043 INFO L158 Benchmark]: RCFGBuilder took 668.46ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 66.7MB in the beginning and 120.1MB in the end (delta: -53.4MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-09 00:41:24,044 INFO L158 Benchmark]: CodeCheck took 30637.54ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 120.1MB in the beginning and 111.9MB in the end (delta: 8.1MB). Peak memory consumption was 187.3MB. Max. memory is 16.1GB. [2024-11-09 00:41:24,044 INFO L158 Benchmark]: Witness Printer took 151.20ms. Allocated memory is still 339.7MB. Free memory was 110.9MB in the beginning and 106.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:41:24,080 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: 29.9s, OverallIterations: 44, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7188 SdHoareTripleChecker+Valid, 38.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6889 mSDsluCounter, 4496 SdHoareTripleChecker+Invalid, 33.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4068 mSDsCounter, 1687 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16192 IncrementalHoareTripleChecker+Invalid, 17879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1687 mSolverCounterUnsat, 428 mSDtfsCounter, 16192 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4376 GetRequests, 3924 SyntacticMatches, 192 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37686 ImplicationChecksByTransitivity, 22.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 461 ConstructedInterpolants, 0 QuantifiedInterpolants, 4596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 56/56 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: 565]: 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 3.90ms. Allocated memory is still 127.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 550.99ms. Allocated memory is still 127.9MB. Free memory was 88.7MB in the beginning and 70.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.10ms. Allocated memory is still 127.9MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.29ms. Allocated memory is still 127.9MB. Free memory was 68.1MB in the beginning and 67.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 668.46ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 66.7MB in the beginning and 120.1MB in the end (delta: -53.4MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * CodeCheck took 30637.54ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 120.1MB in the beginning and 111.9MB in the end (delta: 8.1MB). Peak memory consumption was 187.3MB. Max. memory is 16.1GB. * Witness Printer took 151.20ms. Allocated memory is still 339.7MB. Free memory was 110.9MB in the beginning and 106.7MB in the end (delta: 4.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-09 00:41:24,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d4f7514-f2c5-4dbe-ae68-999bf5f0e1b7/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE