./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-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_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/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_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/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_4c62f686-1b5c-4e2c-91bd-0ab028407611/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 b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:06:51,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:06:51,499 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-08 22:06:51,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:06:51,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:06:51,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:06:51,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:06:51,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:06:51,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:06:51,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:06:51,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:06:51,531 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 22:06:51,531 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 22:06:51,531 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 22:06:51,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:06:51,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:06:51,533 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 22:06:51,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:06:51,533 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:06:51,534 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:06:51,534 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:06:51,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:06:51,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:06:51,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:06:51,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:06:51,539 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:06:51,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:06:51,540 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_4c62f686-1b5c-4e2c-91bd-0ab028407611/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_4c62f686-1b5c-4e2c-91bd-0ab028407611/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 -> b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b [2024-11-08 22:06:51,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:06:51,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:06:51,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:06:51,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:06:51,886 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:06:51,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i Unable to find full path for "g++" [2024-11-08 22:06:53,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:06:54,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:06:54,235 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2024-11-08 22:06:54,256 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/data/5b8f0b6f5/f795257931c345dba46ce50a73c771d7/FLAGcb0a1871f [2024-11-08 22:06:54,277 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/data/5b8f0b6f5/f795257931c345dba46ce50a73c771d7 [2024-11-08 22:06:54,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:06:54,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:06:54,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:06:54,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:06:54,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:06:54,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a5f9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54, skipping insertion in model container [2024-11-08 22:06:54,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:06:54,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:06:54,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:06:54,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:06:54,841 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:06:54,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54 WrapperNode [2024-11-08 22:06:54,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:06:54,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:06:54,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:06:54,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:06:54,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,890 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-08 22:06:54,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:06:54,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:06:54,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:06:54,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:06:54,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:06:54,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:06:54,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:06:54,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:06:54,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:06:54" (1/1) ... [2024-11-08 22:06:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:06:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:06:54,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:06:54,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:06:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 22:06:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 22:06:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 22:06:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 22:06:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:06:55,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:06:55,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:06:55,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:06:55,466 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-08 22:06:55,466 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:06:55,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:06:55,534 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:06:55,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:06:55 BoogieIcfgContainer [2024-11-08 22:06:55,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:06:55,541 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:06:55,541 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:06:55,553 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:06:55,554 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:06:55" (1/1) ... [2024-11-08 22:06:55,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:06:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 54 states and 58 transitions. [2024-11-08 22:06:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-08 22:06:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 22:06:55,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 53 states and 57 transitions. [2024-11-08 22:06:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-08 22:06:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 22:06:56,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 52 states and 56 transitions. [2024-11-08 22:06:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-08 22:06:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 22:06:56,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 51 states and 55 transitions. [2024-11-08 22:06:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-08 22:06:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 22:06:56,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 50 states and 54 transitions. [2024-11-08 22:06:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-11-08 22:06:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 22:06:57,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 49 states and 53 transitions. [2024-11-08 22:06:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-11-08 22:06:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 22:06:57,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 48 states and 52 transitions. [2024-11-08 22:06:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2024-11-08 22:06:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 22:06:58,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 47 states and 51 transitions. [2024-11-08 22:06:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-11-08 22:06:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 22:06:58,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 46 states and 50 transitions. [2024-11-08 22:06:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-08 22:06:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:06:59,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:06:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 45 states and 49 transitions. [2024-11-08 22:06:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-08 22:06:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:06:59,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 44 states and 48 transitions. [2024-11-08 22:07:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2024-11-08 22:07:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 22:07:00,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 45 states and 48 transitions. [2024-11-08 22:07:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-08 22:07:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:07:00,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 48 states and 53 transitions. [2024-11-08 22:07:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-11-08 22:07:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:07:02,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 49 states and 55 transitions. [2024-11-08 22:07:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-08 22:07:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:07:03,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:03,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 50 states and 57 transitions. [2024-11-08 22:07:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-08 22:07:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:07:04,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 49 states and 54 transitions. [2024-11-08 22:07:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-08 22:07:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:07:05,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:05,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 51 states and 57 transitions. [2024-11-08 22:07:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-08 22:07:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:07:07,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 50 states and 56 transitions. [2024-11-08 22:07:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-08 22:07:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:07:07,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 49 states and 55 transitions. [2024-11-08 22:07:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-08 22:07:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:07:08,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:08,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 53 states and 61 transitions. [2024-11-08 22:07:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-08 22:07:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:07:09,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 57 states and 67 transitions. [2024-11-08 22:07:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-08 22:07:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:07:10,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 56 states and 66 transitions. [2024-11-08 22:07:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-08 22:07:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:07:10,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 58 states and 69 transitions. [2024-11-08 22:07:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-11-08 22:07:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:07:10,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 59 states and 71 transitions. [2024-11-08 22:07:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-11-08 22:07:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:07:10,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 64 states and 78 transitions. [2024-11-08 22:07:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2024-11-08 22:07:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:07:11,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 65 states and 80 transitions. [2024-11-08 22:07:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2024-11-08 22:07:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:07:11,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 67 states and 83 transitions. [2024-11-08 22:07:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-11-08 22:07:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:07:11,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 66 states and 82 transitions. [2024-11-08 22:07:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-11-08 22:07:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:07:11,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 67 states and 83 transitions. [2024-11-08 22:07:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-11-08 22:07:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:07:11,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 69 states and 89 transitions. [2024-11-08 22:07:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-11-08 22:07:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:07:15,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:15,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:15,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-08 22:07:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 77 states and 103 transitions. [2024-11-08 22:07:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2024-11-08 22:07:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:07:20,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 79 states and 105 transitions. [2024-11-08 22:07:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2024-11-08 22:07:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:07:20,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 81 states and 107 transitions. [2024-11-08 22:07:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2024-11-08 22:07:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:07:20,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 80 states and 106 transitions. [2024-11-08 22:07:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2024-11-08 22:07:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:07:20,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 81 states and 111 transitions. [2024-11-08 22:07:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2024-11-08 22:07:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:07:20,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:07:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 81 states and 110 transitions. [2024-11-08 22:07:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-11-08 22:07:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:07:20,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:07:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 83 states and 111 transitions. [2024-11-08 22:07:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2024-11-08 22:07:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 22:07:21,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:07:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-08 22:07:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-08 22:07:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 22:07:22,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:07:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 88 states and 119 transitions. [2024-11-08 22:07:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 119 transitions. [2024-11-08 22:07:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:07:23,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:07:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 91 states and 124 transitions. [2024-11-08 22:07:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2024-11-08 22:07:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:07:23,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:07:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 93 states and 127 transitions. [2024-11-08 22:07:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2024-11-08 22:07:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:07:23,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:07:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 37 states and 41 transitions. [2024-11-08 22:07:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-08 22:07:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:07:24,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:07:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 29 states and 32 transitions. [2024-11-08 22:07:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-08 22:07:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:07:24,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:24,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 38 states and 44 transitions. [2024-11-08 22:07:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-08 22:07:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:07:32,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 50 states and 62 transitions. [2024-11-08 22:07:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-11-08 22:07:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:07:40,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:08:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 64 states and 86 transitions. [2024-11-08 22:08:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2024-11-08 22:08:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:08:01,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:08:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 68 states and 91 transitions. [2024-11-08 22:08:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2024-11-08 22:08:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:08:07,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:08:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 73 states and 96 transitions. [2024-11-08 22:08:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-08 22:08:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:08:13,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:08:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 77 states and 104 transitions. [2024-11-08 22:08:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2024-11-08 22:08:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:08:30,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:08:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 83 states and 115 transitions. [2024-11-08 22:08:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2024-11-08 22:08:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:08:49,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 22:08:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:08:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 85 states and 118 transitions. [2024-11-08 22:08:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2024-11-08 22:08:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:08:51,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:08:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:09:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:09:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 35 states and 39 transitions. [2024-11-08 22:09:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-08 22:09:04,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 22:09:04,741 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 52 iterations. [2024-11-08 22:09:04,750 INFO L729 CodeCheckObserver]: All specifications hold 31 specifications checked. All of them hold [2024-11-08 22:09:10,836 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,837 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,837 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,837 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,837 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,838 INFO L77 FloydHoareUtils]: At program point L564(line 564) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ .cse11 1) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 (not (= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse12 .cse11) .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16))) [2024-11-08 22:09:10,838 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,838 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,839 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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) (= |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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 22:09:10,839 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~mem11#1| 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem11#1|) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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) (= |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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 22:09:10,839 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,839 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 568 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 22:09:10,840 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) [2024-11-08 22:09:10,840 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) [2024-11-08 22:09:10,840 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,845 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,846 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) [2024-11-08 22:09:10,846 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,846 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 567) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 22:09:10,846 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 22:09:10,846 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,847 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK(lines 568 570) no Hoare annotation was computed. [2024-11-08 22:09:10,847 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,847 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,847 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,847 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,847 INFO L77 FloydHoareUtils]: At program point L562(line 562) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 22:09:10,848 INFO L77 FloydHoareUtils]: At program point L562-1(line 562) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= .cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= .cse0 |ULTIMATE.start_test_fun_#t~mem12#1|) (<= 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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 22:09:10,848 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,848 INFO L77 FloydHoareUtils]: At program point L558-1(lines 558 565) the Hoare annotation is: (let ((.cse7 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse14 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse9 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse10 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse12 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_test_fun_#t~mem8#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse14) .cse4 .cse15 .cse5 .cse6) (and .cse7 .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse8 (not (= .cse14 0)) .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse4 .cse15 .cse5 .cse6))) [2024-11-08 22:09:10,848 INFO L77 FloydHoareUtils]: At program point L558-3(lines 558 565) the Hoare annotation is: (let ((.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ .cse11 1) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (= .cse11 0) .cse2 .cse3 .cse5 .cse6 .cse8 .cse13 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (not (= .cse12 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16))) [2024-11-08 22:09:10,849 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 22:09:10,849 INFO L77 FloydHoareUtils]: At program point L558-4(lines 558 565) the Hoare annotation is: (and (= (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~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|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 22:09:10,849 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 22:09:10,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,849 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,850 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,850 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse11) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (not (= .cse11 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2024-11-08 22:09:10,850 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_test_fun_#t~mem9#1| 1) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2024-11-08 22:09:10,851 INFO L77 FloydHoareUtils]: At program point L559-2(lines 559 563) the Hoare annotation is: (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse6 (= .cse4 0)) (.cse5 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse11 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse12 (= |ULTIMATE.start_test_fun_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse16 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_test_fun_#t~mem9#1| 1) .cse4) (<= |ULTIMATE.start_test_fun_#t~mem9#1| |ULTIMATE.start_test_fun_#t~mem10#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 (not .cse6) (= .cse4 |ULTIMATE.start_test_fun_#t~mem10#1|) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2024-11-08 22:09:10,851 INFO L77 FloydHoareUtils]: At program point L559-4(lines 559 563) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse13 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse15 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ .cse11 1) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 (not (= .cse11 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse12 .cse11) .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16))) [2024-11-08 22:09:10,852 INFO L77 FloydHoareUtils]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse0 (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (or |ULTIMATE.start_test_fun_#t~short7#1| (not .cse0)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (or .cse0 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 22:09:10,852 INFO L77 FloydHoareUtils]: At program point L555-3(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#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) (= |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_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 22:09:10,852 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:09:10,853 INFO L77 FloydHoareUtils]: At program point L555-5(lines 555 557) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse3 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#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|))) (or (and |ULTIMATE.start_test_fun_#t~short7#1| .cse0 .cse1 .cse2 .cse3) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse0 (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0)) (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse1 (= |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|)) .cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))))) [2024-11-08 22:09:10,861 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:09:10,862 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:09:10,866 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:09:10,867 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:09:10,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:09:10 ImpRootNode [2024-11-08 22:09:10,869 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:09:10,869 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:09:10,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:09:10,870 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:09:10,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:06:55" (3/4) ... [2024-11-08 22:09:10,874 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 22:09:10,882 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-08 22:09:10,882 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 22:09:10,882 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 22:09:10,883 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 22:09:10,985 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:09:10,986 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 22:09:10,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:09:10,987 INFO L158 Benchmark]: Toolchain (without parser) took 136704.82ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 79.0MB in the beginning and 759.3MB in the end (delta: -680.2MB). Peak memory consumption was 507.8MB. Max. memory is 16.1GB. [2024-11-08 22:09:10,987 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:09:10,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.21ms. Allocated memory is still 121.6MB. Free memory was 79.0MB in the beginning and 60.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:09:10,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.35ms. Allocated memory is still 121.6MB. Free memory was 60.5MB in the beginning and 58.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:09:10,988 INFO L158 Benchmark]: Boogie Preprocessor took 26.99ms. Allocated memory is still 121.6MB. Free memory was 58.5MB in the beginning and 57.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:09:10,989 INFO L158 Benchmark]: RCFGBuilder took 621.54ms. Allocated memory is still 121.6MB. Free memory was 57.2MB in the beginning and 81.3MB in the end (delta: -24.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 22:09:10,989 INFO L158 Benchmark]: CodeCheck took 135327.45ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 81.3MB in the beginning and 764.5MB in the end (delta: -683.2MB). Peak memory consumption was 501.9MB. Max. memory is 16.1GB. [2024-11-08 22:09:10,990 INFO L158 Benchmark]: Witness Printer took 116.57ms. Allocated memory is still 1.3GB. Free memory was 764.5MB in the beginning and 759.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:09:10,992 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, 54 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 129.2s, OverallIterations: 52, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9090 SdHoareTripleChecker+Valid, 40.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8278 mSDsluCounter, 3365 SdHoareTripleChecker+Invalid, 35.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2592 mSDsCounter, 2973 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22714 IncrementalHoareTripleChecker+Invalid, 25687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2973 mSolverCounterUnsat, 773 mSDtfsCounter, 22714 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6623 GetRequests, 5652 SyntacticMatches, 295 SemanticMatches, 676 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247561 ImplicationChecksByTransitivity, 117.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 755 ConstructedInterpolants, 0 QuantifiedInterpolants, 9705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 46 PerfectInterpolantSequences, 127/163 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: -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: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.21ms. Allocated memory is still 121.6MB. Free memory was 79.0MB in the beginning and 60.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.35ms. Allocated memory is still 121.6MB. Free memory was 60.5MB in the beginning and 58.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.99ms. Allocated memory is still 121.6MB. Free memory was 58.5MB in the beginning and 57.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 621.54ms. Allocated memory is still 121.6MB. Free memory was 57.2MB in the beginning and 81.3MB in the end (delta: -24.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * CodeCheck took 135327.45ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 81.3MB in the beginning and 764.5MB in the end (delta: -683.2MB). Peak memory consumption was 501.9MB. Max. memory is 16.1GB. * Witness Printer took 116.57ms. Allocated memory is still 1.3GB. Free memory was 764.5MB in the beginning and 759.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid RESULT: Ultimate proved your program to be correct! [2024-11-08 22:09:11,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62f686-1b5c-4e2c-91bd-0ab028407611/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE