./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 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_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:35:56,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:35:57,013 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 20:35:57,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:35:57,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:35:57,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:35:57,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:35:57,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:35:57,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:35:57,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:35:57,088 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:35:57,089 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:35:57,089 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:35:57,091 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:35:57,092 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:35:57,092 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:35:57,093 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:35:57,093 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:35:57,094 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:35:57,094 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:35:57,095 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:35:57,095 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:35:57,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:35:57,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:35:57,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:35:57,098 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:35:57,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:35:57,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:35:57,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:35:57,099 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:35:57,101 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:35:57,101 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:35:57,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:35:57,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:35:57,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:35:57,102 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:35:57,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:35:57,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:35:57,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:35:57,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:35:57,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:57,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:35:57,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:35:57,104 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:35:57,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:35:57,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:35:57,105 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:35:57,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:35:57,106 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/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_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-11-23 20:35:57,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:35:57,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:35:57,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:35:57,426 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:35:57,427 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:35:57,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-23 20:36:00,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:36:01,024 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:36:01,025 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-23 20:36:01,046 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data/6d65266d6/5f9268b45a5a456b9125d005511b4937/FLAG0c3f70cb9 [2023-11-23 20:36:01,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data/6d65266d6/5f9268b45a5a456b9125d005511b4937 [2023-11-23 20:36:01,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:36:01,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:36:01,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:01,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:36:01,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:36:01,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:01" (1/1) ... [2023-11-23 20:36:01,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22458e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:01, skipping insertion in model container [2023-11-23 20:36:01,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:01" (1/1) ... [2023-11-23 20:36:01,157 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:36:01,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:01,605 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-23 20:36:01,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@50f21355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:01, skipping insertion in model container [2023-11-23 20:36:01,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:01,606 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-23 20:36:01,608 INFO L158 Benchmark]: Toolchain (without parser) took 534.10ms. Allocated memory is still 138.4MB. Free memory was 90.1MB in the beginning and 77.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 20:36:01,609 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 113.2MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:36:01,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.18ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 77.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 20:36:01,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 113.2MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.18ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 77.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:36:04,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:36:04,186 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-23 20:36:04,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:36:04,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:36:04,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:36:04,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:36:04,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:36:04,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:36:04,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:36:04,262 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:36:04,262 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:36:04,263 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:36:04,264 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:36:04,265 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:36:04,265 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:36:04,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:36:04,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:36:04,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:36:04,268 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:36:04,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:36:04,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:36:04,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:36:04,270 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:36:04,271 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:36:04,271 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:36:04,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:36:04,272 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:36:04,272 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 20:36:04,273 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 20:36:04,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:36:04,275 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:36:04,275 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:36:04,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:36:04,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 20:36:04,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:36:04,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:36:04,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:36:04,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:36:04,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:36:04,278 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-23 20:36:04,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 20:36:04,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:36:04,279 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:36:04,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:36:04,279 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/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_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-11-23 20:36:04,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:36:04,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:36:04,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:36:04,729 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:36:04,730 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:36:04,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-23 20:36:07,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:36:08,203 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:36:08,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-23 20:36:08,222 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data/e62c0f2f8/23488c0a256b40599abbd8ff99534b4d/FLAGb79562e13 [2023-11-23 20:36:08,237 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/data/e62c0f2f8/23488c0a256b40599abbd8ff99534b4d [2023-11-23 20:36:08,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:36:08,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:36:08,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:08,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:36:08,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:36:08,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b41181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08, skipping insertion in model container [2023-11-23 20:36:08,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:36:08,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:08,709 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 20:36:08,726 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:36:08,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:08,770 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:36:08,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:08,846 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:36:08,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08 WrapperNode [2023-11-23 20:36:08,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:08,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:36:08,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:36:08,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:36:08,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,908 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-23 20:36:08,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:36:08,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:36:08,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:36:08,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:36:08,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:36:08,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:36:08,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:36:08,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:36:08,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (1/1) ... [2023-11-23 20:36:08,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:36:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:08,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:36:09,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:36:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-23 20:36:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 20:36:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-11-23 20:36:09,040 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-11-23 20:36:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:36:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:36:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 20:36:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 20:36:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:36:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-23 20:36:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 20:36:09,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 20:36:09,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:36:09,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:36:09,207 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:36:09,210 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:36:10,181 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:36:10,249 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:36:10,249 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-23 20:36:10,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:10 BoogieIcfgContainer [2023-11-23 20:36:10,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:36:10,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:36:10,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:36:10,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:36:10,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:36:08" (1/3) ... [2023-11-23 20:36:10,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e61a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:10, skipping insertion in model container [2023-11-23 20:36:10,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:08" (2/3) ... [2023-11-23 20:36:10,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e61a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:10, skipping insertion in model container [2023-11-23 20:36:10,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:10" (3/3) ... [2023-11-23 20:36:10,258 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2023-11-23 20:36:10,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:36:10,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-11-23 20:36:10,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:36:10,337 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ca8fdea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:36:10,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-11-23 20:36:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 73 states have (on average 2.4794520547945207) internal successors, (181), 165 states have internal predecessors, (181), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-23 20:36:10,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:10,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-23 20:36:10,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:10,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash 328757, now seen corresponding path program 1 times [2023-11-23 20:36:10,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593351881] [2023-11-23 20:36:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:10,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:10,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 20:36:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:10,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 20:36:10,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:10,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:10,511 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593351881] [2023-11-23 20:36:10,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593351881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:10,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:10,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362139800] [2023-11-23 20:36:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:10,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 20:36:10,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 20:36:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 20:36:10,574 INFO L87 Difference]: Start difference. First operand has 169 states, 73 states have (on average 2.4794520547945207) internal successors, (181), 165 states have internal predecessors, (181), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:10,744 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2023-11-23 20:36:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 20:36:10,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-23 20:36:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:10,757 INFO L225 Difference]: With dead ends: 169 [2023-11-23 20:36:10,757 INFO L226 Difference]: Without dead ends: 168 [2023-11-23 20:36:10,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 20:36:10,763 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:10,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-23 20:36:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-11-23 20:36:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 73 states have (on average 2.410958904109589) internal successors, (176), 164 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2023-11-23 20:36:10,834 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 3 [2023-11-23 20:36:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:10,836 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2023-11-23 20:36:10,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2023-11-23 20:36:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-23 20:36:10,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:10,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-23 20:36:10,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-23 20:36:11,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:11,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:11,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 326321, now seen corresponding path program 1 times [2023-11-23 20:36:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007339830] [2023-11-23 20:36:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:11,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:11,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:11,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 20:36:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:11,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 20:36:11,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:11,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 20:36:11,247 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:36:11,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-23 20:36:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:11,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:11,278 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:11,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007339830] [2023-11-23 20:36:11,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007339830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:11,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:11,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190787833] [2023-11-23 20:36:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:11,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:36:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:36:11,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:36:11,287 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:12,189 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2023-11-23 20:36:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:36:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-23 20:36:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:12,195 INFO L225 Difference]: With dead ends: 162 [2023-11-23 20:36:12,195 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 20:36:12,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:12,197 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 75 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:12,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 233 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 20:36:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 20:36:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-23 20:36:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 73 states have (on average 2.328767123287671) internal successors, (170), 158 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2023-11-23 20:36:12,225 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 3 [2023-11-23 20:36:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:12,226 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2023-11-23 20:36:12,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2023-11-23 20:36:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-23 20:36:12,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:12,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-23 20:36:12,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-23 20:36:12,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:12,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:12,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 326322, now seen corresponding path program 1 times [2023-11-23 20:36:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886958087] [2023-11-23 20:36:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:12,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:12,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:12,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 20:36:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:12,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 20:36:12,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:12,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:12,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 20:36:12,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:12,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 20:36:12,650 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-23 20:36:12,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-23 20:36:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:12,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:12,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886958087] [2023-11-23 20:36:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886958087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:12,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715668691] [2023-11-23 20:36:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:12,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:36:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:36:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:36:12,678 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:13,745 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2023-11-23 20:36:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:36:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-23 20:36:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:13,750 INFO L225 Difference]: With dead ends: 177 [2023-11-23 20:36:13,750 INFO L226 Difference]: Without dead ends: 177 [2023-11-23 20:36:13,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:13,752 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:13,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 260 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 20:36:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-23 20:36:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2023-11-23 20:36:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 77 states have (on average 2.2857142857142856) internal successors, (176), 162 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2023-11-23 20:36:13,768 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 3 [2023-11-23 20:36:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:13,768 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2023-11-23 20:36:13,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2023-11-23 20:36:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 20:36:13,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:13,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 20:36:13,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-23 20:36:13,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:13,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:13,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash 10116062, now seen corresponding path program 1 times [2023-11-23 20:36:13,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450950452] [2023-11-23 20:36:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:13,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:13,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 20:36:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:14,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 20:36:14,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:14,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 20:36:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:14,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:14,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450950452] [2023-11-23 20:36:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450950452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:14,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:14,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149840698] [2023-11-23 20:36:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:14,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:14,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:14,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:14,066 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:14,473 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2023-11-23 20:36:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-23 20:36:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:14,476 INFO L225 Difference]: With dead ends: 164 [2023-11-23 20:36:14,476 INFO L226 Difference]: Without dead ends: 164 [2023-11-23 20:36:14,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:14,477 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:14,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 211 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:36:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-23 20:36:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-11-23 20:36:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 77 states have (on average 2.2467532467532467) internal successors, (173), 160 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2023-11-23 20:36:14,489 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 4 [2023-11-23 20:36:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:14,489 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2023-11-23 20:36:14,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2023-11-23 20:36:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 20:36:14,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:14,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 20:36:14,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:14,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:14,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:14,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 10116063, now seen corresponding path program 1 times [2023-11-23 20:36:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:14,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30170588] [2023-11-23 20:36:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:14,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:14,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-23 20:36:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:14,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 20:36:14,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:14,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:14,808 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30170588] [2023-11-23 20:36:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30170588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:14,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405053941] [2023-11-23 20:36:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:14,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:14,810 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:15,332 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2023-11-23 20:36:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-23 20:36:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:15,340 INFO L225 Difference]: With dead ends: 162 [2023-11-23 20:36:15,340 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 20:36:15,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:15,341 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:15,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 214 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 20:36:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 20:36:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-23 20:36:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 77 states have (on average 2.207792207792208) internal successors, (170), 158 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2023-11-23 20:36:15,350 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 4 [2023-11-23 20:36:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:15,350 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2023-11-23 20:36:15,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2023-11-23 20:36:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 20:36:15,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:15,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:15,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-23 20:36:15,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:15,553 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:15,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash 998682099, now seen corresponding path program 1 times [2023-11-23 20:36:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645935232] [2023-11-23 20:36:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:15,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:15,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:15,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-23 20:36:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:15,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-23 20:36:15,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:15,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 20:36:15,723 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-23 20:36:15,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-23 20:36:15,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 20:36:15,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 20:36:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:15,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:15,860 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645935232] [2023-11-23 20:36:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645935232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:36:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056238329] [2023-11-23 20:36:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:15,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:36:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:36:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:36:15,862 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:16,699 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2023-11-23 20:36:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:36:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-23 20:36:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:16,701 INFO L225 Difference]: With dead ends: 164 [2023-11-23 20:36:16,701 INFO L226 Difference]: Without dead ends: 164 [2023-11-23 20:36:16,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:36:16,702 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 5 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:16,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 477 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 20:36:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-23 20:36:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2023-11-23 20:36:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 78 states have (on average 2.1923076923076925) internal successors, (171), 159 states have internal predecessors, (171), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2023-11-23 20:36:16,711 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 8 [2023-11-23 20:36:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:16,711 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2023-11-23 20:36:16,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2023-11-23 20:36:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 20:36:16,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:16,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:16,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:16,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:16,915 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:16,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1952744820, now seen corresponding path program 1 times [2023-11-23 20:36:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691117493] [2023-11-23 20:36:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:16,918 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:16,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-23 20:36:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:16,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 20:36:16,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:17,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:17,033 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:17,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691117493] [2023-11-23 20:36:17,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691117493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:17,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:17,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:36:17,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447082354] [2023-11-23 20:36:17,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:17,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:36:17,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:36:17,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:36:17,035 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:17,373 INFO L93 Difference]: Finished difference Result 232 states and 248 transitions. [2023-11-23 20:36:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:36:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-23 20:36:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:17,376 INFO L225 Difference]: With dead ends: 232 [2023-11-23 20:36:17,376 INFO L226 Difference]: Without dead ends: 232 [2023-11-23 20:36:17,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:17,377 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 73 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:17,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 423 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 20:36:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-23 20:36:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 196. [2023-11-23 20:36:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 110 states have (on average 2.2181818181818183) internal successors, (244), 191 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2023-11-23 20:36:17,387 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 10 [2023-11-23 20:36:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:17,387 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2023-11-23 20:36:17,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2023-11-23 20:36:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:36:17,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:17,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:17,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:17,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:17,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:17,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 405553465, now seen corresponding path program 1 times [2023-11-23 20:36:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612355360] [2023-11-23 20:36:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:17,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:17,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:17,596 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:17,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-23 20:36:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:17,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 20:36:17,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:17,721 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:36:17,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-23 20:36:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:17,745 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:17,745 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:17,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612355360] [2023-11-23 20:36:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612355360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:17,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:17,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001053476] [2023-11-23 20:36:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:17,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:17,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:17,747 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:18,247 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2023-11-23 20:36:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:18,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 20:36:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:18,250 INFO L225 Difference]: With dead ends: 183 [2023-11-23 20:36:18,250 INFO L226 Difference]: Without dead ends: 183 [2023-11-23 20:36:18,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:18,251 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:18,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 155 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 20:36:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-23 20:36:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2023-11-23 20:36:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 110 states have (on average 1.9454545454545455) internal successors, (214), 176 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2023-11-23 20:36:18,259 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 11 [2023-11-23 20:36:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:18,259 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2023-11-23 20:36:18,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2023-11-23 20:36:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:36:18,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:18,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:18,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-23 20:36:18,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:18,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:18,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 405553466, now seen corresponding path program 1 times [2023-11-23 20:36:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483124699] [2023-11-23 20:36:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:18,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:18,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:18,465 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:18,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-23 20:36:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:18,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 20:36:18,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:18,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:18,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:18,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:18,612 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483124699] [2023-11-23 20:36:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483124699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:18,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:18,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19036261] [2023-11-23 20:36:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:18,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:18,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:18,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:18,616 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:19,091 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2023-11-23 20:36:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 20:36:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:19,093 INFO L225 Difference]: With dead ends: 168 [2023-11-23 20:36:19,093 INFO L226 Difference]: Without dead ends: 168 [2023-11-23 20:36:19,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:19,094 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:19,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 156 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 20:36:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-23 20:36:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2023-11-23 20:36:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 110 states have (on average 1.6727272727272726) internal successors, (184), 161 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2023-11-23 20:36:19,102 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 11 [2023-11-23 20:36:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:19,103 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2023-11-23 20:36:19,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2023-11-23 20:36:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 20:36:19,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:19,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:19,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:19,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:19,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:19,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 108174754, now seen corresponding path program 1 times [2023-11-23 20:36:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715601373] [2023-11-23 20:36:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:19,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:19,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:19,309 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:19,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-23 20:36:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:19,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 20:36:19,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 20:36:19,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:36:19,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:19,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-23 20:36:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:19,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:19,532 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715601373] [2023-11-23 20:36:19,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715601373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:19,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:19,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:36:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879345607] [2023-11-23 20:36:19,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:19,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:36:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:36:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:19,537 INFO L87 Difference]: Start difference. First operand 166 states and 188 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:20,346 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2023-11-23 20:36:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:36:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-23 20:36:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:20,349 INFO L225 Difference]: With dead ends: 211 [2023-11-23 20:36:20,349 INFO L226 Difference]: Without dead ends: 211 [2023-11-23 20:36:20,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:36:20,350 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 21 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:20,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 306 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 20:36:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-23 20:36:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2023-11-23 20:36:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 167 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2023-11-23 20:36:20,358 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 14 [2023-11-23 20:36:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:20,359 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2023-11-23 20:36:20,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2023-11-23 20:36:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 20:36:20,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:20,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:20,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:20,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:20,563 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:20,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash 108174755, now seen corresponding path program 1 times [2023-11-23 20:36:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19710806] [2023-11-23 20:36:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:20,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:20,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:20,566 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:20,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-23 20:36:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:20,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 20:36:20,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:20,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:20,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:20,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:20,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-23 20:36:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:20,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:20,827 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19710806] [2023-11-23 20:36:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19710806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:20,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:36:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662032651] [2023-11-23 20:36:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:20,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:36:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:36:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:20,829 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:21,712 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2023-11-23 20:36:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:36:21,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-23 20:36:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:21,722 INFO L225 Difference]: With dead ends: 172 [2023-11-23 20:36:21,722 INFO L226 Difference]: Without dead ends: 172 [2023-11-23 20:36:21,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:36:21,723 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:21,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 315 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 20:36:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-23 20:36:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-11-23 20:36:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 116 states have (on average 1.6379310344827587) internal successors, (190), 167 states have internal predecessors, (190), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2023-11-23 20:36:21,730 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 194 transitions. Word has length 14 [2023-11-23 20:36:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:21,731 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 194 transitions. [2023-11-23 20:36:21,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2023-11-23 20:36:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 20:36:21,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:21,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:21,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:21,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:21,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:21,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1416169509, now seen corresponding path program 1 times [2023-11-23 20:36:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:21,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602726443] [2023-11-23 20:36:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:21,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:21,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:21,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:21,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-23 20:36:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:22,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 20:36:22,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:22,131 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:36:22,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-23 20:36:22,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:22,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:22,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-23 20:36:22,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-23 20:36:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:36:22,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:22,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_170) c_create_data_~data~0.base) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-23 20:36:22,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:22,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-23 20:36:22,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-11-23 20:36:22,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:36:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-23 20:36:22,576 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602726443] [2023-11-23 20:36:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602726443] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [568098591] [2023-11-23 20:36:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-23 20:36:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 [2023-11-23 20:36:22,579 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-23 20:36:22,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-11-23 20:36:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:22,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 20:36:22,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:22,895 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:36:22,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-23 20:36:22,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:23,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:23,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-23 20:36:23,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-23 20:36:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:36:23,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:23,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_211) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))))) is different from false [2023-11-23 20:36:23,094 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_211) c_create_data_~data~0.base) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-23 20:36:23,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:23,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-23 20:36:23,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-11-23 20:36:23,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:36:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-23 20:36:23,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [568098591] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:23,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172390166] [2023-11-23 20:36:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:23,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:23,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:23,164 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:23,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 20:36:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:23,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 20:36:23,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:23,326 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 20:36:23,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-23 20:36:23,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:23,440 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:23,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-23 20:36:23,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-23 20:36:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:36:23,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:23,504 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_251) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-23 20:36:23,515 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_251) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2023-11-23 20:36:23,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:23,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-23 20:36:23,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-11-23 20:36:23,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:36:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-23 20:36:23,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172390166] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:23,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-23 20:36:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 6, 5, 6] total 14 [2023-11-23 20:36:23,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483582720] [2023-11-23 20:36:23,580 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:23,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 20:36:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:23,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 20:36:23,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=66, Unknown=9, NotChecked=100, Total=210 [2023-11-23 20:36:23,582 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:24,946 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2023-11-23 20:36:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:36:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 20:36:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:24,949 INFO L225 Difference]: With dead ends: 177 [2023-11-23 20:36:24,949 INFO L226 Difference]: Without dead ends: 177 [2023-11-23 20:36:24,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=66, Unknown=9, NotChecked=100, Total=210 [2023-11-23 20:36:24,950 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 38 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:24,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 686 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 386 Invalid, 0 Unknown, 442 Unchecked, 1.3s Time] [2023-11-23 20:36:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-23 20:36:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2023-11-23 20:36:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 116 states have (on average 1.6206896551724137) internal successors, (188), 166 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2023-11-23 20:36:24,958 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 17 [2023-11-23 20:36:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:24,958 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2023-11-23 20:36:24,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2023-11-23 20:36:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 20:36:24,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:24,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:24,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:25,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:25,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-23 20:36:25,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:25,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:25,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1416169510, now seen corresponding path program 1 times [2023-11-23 20:36:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162478154] [2023-11-23 20:36:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:25,563 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:25,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-23 20:36:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:25,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 20:36:25,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:25,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:25,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:25,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:25,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:25,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:25,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:25,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:26,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:26,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:26,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:26,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_293) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_293) c_create_data_~data~0.base) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_294) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-23 20:36:26,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_294) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2023-11-23 20:36:26,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:26,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-23 20:36:26,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-11-23 20:36:26,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:26,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-23 20:36:26,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:26,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-23 20:36:26,536 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:26,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-23 20:36:26,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:26,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-23 20:36:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-23 20:36:26,627 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:26,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162478154] [2023-11-23 20:36:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162478154] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:26,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1075100528] [2023-11-23 20:36:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:26,628 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-23 20:36:26,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 [2023-11-23 20:36:26,629 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-23 20:36:26,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-11-23 20:36:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:26,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 20:36:26,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:26,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:26,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:26,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:26,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:27,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:27,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:27,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:27,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:27,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:27,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:27,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_336) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_337) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_336) c_create_data_~data~0.base) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2023-11-23 20:36:27,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_336) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_336) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_337) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-23 20:36:27,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:27,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-23 20:36:27,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-11-23 20:36:27,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:27,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-23 20:36:27,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:27,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-23 20:36:27,395 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:27,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-23 20:36:27,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:27,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-23 20:36:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-23 20:36:27,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1075100528] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:27,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003849846] [2023-11-23 20:36:27,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:27,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:27,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:27,425 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:27,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 20:36:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:27,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 20:36:27,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:27,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:27,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:27,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:27,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:27,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:27,719 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:27,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:27,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:27,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:27,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:27,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:27,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_379) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_380) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_379) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-23 20:36:27,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_379) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_379) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_380) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-23 20:36:27,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:27,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-23 20:36:27,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-11-23 20:36:28,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:28,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-23 20:36:28,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:28,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-23 20:36:28,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:28,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-23 20:36:28,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:28,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-23 20:36:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-23 20:36:28,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003849846] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:28,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-23 20:36:28,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 15 [2023-11-23 20:36:28,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721728263] [2023-11-23 20:36:28,058 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:28,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 20:36:28,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 20:36:28,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=73, Unknown=6, NotChecked=126, Total=240 [2023-11-23 20:36:28,060 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:30,732 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2023-11-23 20:36:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:36:30,737 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 20:36:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:30,739 INFO L225 Difference]: With dead ends: 177 [2023-11-23 20:36:30,739 INFO L226 Difference]: Without dead ends: 177 [2023-11-23 20:36:30,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=47, Invalid=103, Unknown=6, NotChecked=150, Total=306 [2023-11-23 20:36:30,740 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:30,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 897 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 477 Invalid, 0 Unknown, 471 Unchecked, 2.2s Time] [2023-11-23 20:36:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-23 20:36:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-11-23 20:36:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 122 states have (on average 1.5901639344262295) internal successors, (194), 172 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 198 transitions. [2023-11-23 20:36:30,747 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 198 transitions. Word has length 17 [2023-11-23 20:36:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:30,747 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 198 transitions. [2023-11-23 20:36:30,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2023-11-23 20:36:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 20:36:30,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:30,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:30,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:30,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:31,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:31,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:31,365 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:31,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash -350360893, now seen corresponding path program 2 times [2023-11-23 20:36:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811698950] [2023-11-23 20:36:31,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 20:36:31,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:31,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:31,367 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:31,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-23 20:36:31,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 20:36:31,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:31,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-23 20:36:31,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:31,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:31,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:31,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:31,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:31,836 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:31,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:31,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:32,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:32,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:32,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:32,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:32,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:32,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:32,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_439) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_439) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_440) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-23 20:36:32,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_439) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_440) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_439) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-23 20:36:32,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_438) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_437) c_create_data_~data~0.base) .cse2) v_ArrVal_439) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_437))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_438) .cse3 v_ArrVal_439) c_create_data_~data~0.base) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_440) c_create_data_~data~0.base) .cse2)))))))) is different from false [2023-11-23 20:36:32,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_437))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_438) .cse1 v_ArrVal_439) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_440) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_438) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_437) c_create_data_~data~0.base) .cse2) v_ArrVal_439) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2023-11-23 20:36:32,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:32,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 20:36:32,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:32,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-11-23 20:36:32,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 640 [2023-11-23 20:36:32,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 745 treesize of output 697 [2023-11-23 20:36:32,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 100 [2023-11-23 20:36:32,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2023-11-23 20:36:32,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2023-11-23 20:36:32,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-11-23 20:36:33,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:33,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2023-11-23 20:36:33,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:33,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2023-11-23 20:36:33,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2023-11-23 20:36:33,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 244 [2023-11-23 20:36:33,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-23 20:36:33,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-23 20:36:33,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 20:36:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-23 20:36:33,348 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811698950] [2023-11-23 20:36:33,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811698950] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [908007310] [2023-11-23 20:36:33,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 20:36:33,349 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-23 20:36:33,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 [2023-11-23 20:36:33,353 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-23 20:36:33,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-11-23 20:36:33,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 20:36:33,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:33,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-23 20:36:33,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:33,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:33,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:33,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:33,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:33,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:33,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:33,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:33,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:34,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:34,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:34,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:34,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:34,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:34,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:34,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_500) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_499) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_500) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-23 20:36:34,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_500) c_create_data_~data~0.base) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_499) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_500) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse3 (_ bv4 32) .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2023-11-23 20:36:34,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_497 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_498))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_497) .cse0 v_ArrVal_500) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_499) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_497 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_497) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_498) c_create_data_~data~0.base) .cse1) v_ArrVal_500) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-23 20:36:34,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_497 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_498))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_497) .cse1 v_ArrVal_500) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_499) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_497 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_497) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_498) c_create_data_~data~0.base) .cse2) v_ArrVal_500) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2023-11-23 20:36:34,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:34,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 20:36:34,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:34,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-11-23 20:36:35,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 640 [2023-11-23 20:36:35,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 385 [2023-11-23 20:36:35,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 104 [2023-11-23 20:36:35,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2023-11-23 20:36:35,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2023-11-23 20:36:35,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2023-11-23 20:36:35,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:35,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2023-11-23 20:36:35,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:35,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2023-11-23 20:36:35,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2023-11-23 20:36:35,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2023-11-23 20:36:35,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-23 20:36:35,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 20:36:35,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-23 20:36:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-23 20:36:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [908007310] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:35,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449854630] [2023-11-23 20:36:35,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 20:36:35,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:36:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:35,285 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:36:35,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-23 20:36:35,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 20:36:35,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:35,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-23 20:36:35,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:35,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:35,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:35,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:35,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:35,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:35,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:35,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:35,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:35,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:35,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:35,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:35,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:35,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_559) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_559) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_560) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-23 20:36:36,016 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_559) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_560) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_559) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-23 20:36:36,163 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_557))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_558) .cse0 v_ArrVal_559) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_560) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_558) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_557) c_create_data_~data~0.base) .cse1) v_ArrVal_559) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-23 20:36:36,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_558) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_557) c_create_data_~data~0.base) .cse3) v_ArrVal_559) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_557))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_558) .cse4 v_ArrVal_559) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_560) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-23 20:36:36,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:36,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2023-11-23 20:36:36,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:36,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2023-11-23 20:36:36,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2023-11-23 20:36:36,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2023-11-23 20:36:36,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-23 20:36:36,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-23 20:36:36,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 20:36:36,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:36,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 20:36:36,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:36,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-11-23 20:36:36,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:36,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2023-11-23 20:36:36,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:36,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-23 20:36:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-23 20:36:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449854630] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:36,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-23 20:36:36,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 23 [2023-11-23 20:36:36,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292809015] [2023-11-23 20:36:36,608 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:36,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-23 20:36:36,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-23 20:36:36,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=114, Unknown=12, NotChecked=372, Total=552 [2023-11-23 20:36:36,610 INFO L87 Difference]: Start difference. First operand 177 states and 198 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:41,069 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2023-11-23 20:36:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 20:36:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-23 20:36:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:41,072 INFO L225 Difference]: With dead ends: 183 [2023-11-23 20:36:41,072 INFO L226 Difference]: Without dead ends: 183 [2023-11-23 20:36:41,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=72, Invalid=174, Unknown=12, NotChecked=444, Total=702 [2023-11-23 20:36:41,073 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 978 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:41,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1353 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 591 Invalid, 0 Unknown, 978 Unchecked, 2.7s Time] [2023-11-23 20:36:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-23 20:36:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-11-23 20:36:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 128 states have (on average 1.5625) internal successors, (200), 178 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 20:36:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2023-11-23 20:36:41,080 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 20 [2023-11-23 20:36:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:41,080 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2023-11-23 20:36:41,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2023-11-23 20:36:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 20:36:41,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:41,082 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:41,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:41,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:41,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:41,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:41,697 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-23 20:36:41,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash -823318778, now seen corresponding path program 3 times [2023-11-23 20:36:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:41,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636604774] [2023-11-23 20:36:41,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 20:36:41,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 20:36:41,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:41,700 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 20:36:41,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-23 20:36:42,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 20:36:42,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:42,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-23 20:36:42,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:42,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:42,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:42,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:42,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:42,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:42,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:42,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:42,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:42,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:42,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:42,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:42,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:42,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:42,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:42,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:42,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:43,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_637) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_637) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_636) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-23 20:36:43,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_637) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_637) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_636) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-23 20:36:43,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_635) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_634) c_create_data_~data~0.base) .cse2) v_ArrVal_637) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_634))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_635) .cse3 v_ArrVal_637) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_636) c_create_data_~data~0.base) .cse2)))))))) is different from false [2023-11-23 20:36:43,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_634))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_635) .cse1 v_ArrVal_637) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_636) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_635) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_634) c_create_data_~data~0.base) .cse2) v_ArrVal_637) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2023-11-23 20:36:45,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_632))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_633) .cse2 v_ArrVal_635) (select (select (store .cse3 .cse2 v_ArrVal_634) c_create_data_~data~0.base) .cse4) v_ArrVal_637))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_632))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_634))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_633) .cse5 v_ArrVal_635) .cse6 v_ArrVal_637) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_636) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2023-11-23 20:36:47,817 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_632))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_633) .cse3 v_ArrVal_635) (select (select (store .cse4 .cse3 v_ArrVal_634) c_create_data_~data~0.base) .cse5) v_ArrVal_637))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_632))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_634))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_633) .cse6 v_ArrVal_635) .cse7 v_ArrVal_637) c_create_data_~data~0.base) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_636) c_create_data_~data~0.base) .cse5))))))))))) is different from false [2023-11-23 20:36:47,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:47,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2023-11-23 20:36:47,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:47,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2023-11-23 20:36:47,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 588 treesize of output 498 [2023-11-23 20:36:48,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 806 treesize of output 740 [2023-11-23 20:36:48,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2023-11-23 20:36:48,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-23 20:36:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-11-23 20:36:48,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2023-11-23 20:36:48,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-23 20:36:48,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:48,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2023-11-23 20:36:48,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:48,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2023-11-23 20:36:48,266 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:48,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 310 [2023-11-23 20:36:48,294 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:36:48,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-23 20:36:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-23 20:36:48,597 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636604774] [2023-11-23 20:36:48,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636604774] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:36:48,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [912590351] [2023-11-23 20:36:48,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 20:36:48,598 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-23 20:36:48,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 [2023-11-23 20:36:48,600 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-23 20:36:48,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33240e67-23b1-49c1-9f2f-4eb7ed8d439c/bin/utaipan-verify-mE87zJ7Ire/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-23 20:36:49,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 20:36:49,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:36:49,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 20:36:49,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:49,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:49,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-23 20:36:49,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 20:36:49,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 20:36:49,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 20:36:49,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:49,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:49,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:50,107 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:50,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:50,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:50,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 20:36:50,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-23 20:36:50,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-23 20:36:50,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-23 20:36:50,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 20:36:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:50,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:51,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse4)) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse2 (bvadd (_ bv4 32) .cse0 .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (or (not (bvule (bvadd .cse0 .cse1) .cse2)) (and (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_713) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_714) c_create_data_~data~0.base) .cse4)))) (forall ((v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_713) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv4 32) .cse5 .cse1) (bvadd (_ bv8 32) .cse5 .cse1))))) (not (bvule .cse2 (select |c_#length| .cse3))))))) is different from false [2023-11-23 20:36:53,194 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_712))) (let ((.cse7 (select (select .cse0 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (bvadd (_ bv8 32) .cse7 .cse3))) (or (forall ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_711))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (or (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse0 .cse1 v_ArrVal_713) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_714) c_create_data_~data~0.base) .cse2)))) (not (bvule .cse5 (select |c_#length| .cse1))))))) (not (bvule (bvadd (_ bv4 32) .cse7 .cse3) .cse5))))))) (forall ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_712))) (let ((.cse12 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (let ((.cse8 (bvadd (_ bv8 32) .cse12 .cse3))) (or (forall ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_711) c_create_data_~data~0.base) .cse2))) (or (not (bvule .cse8 (select |c_#length| .cse9))) (forall ((v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store .cse11 .cse9 v_ArrVal_713) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse10 (_ bv8 32) .cse3) (bvadd .cse10 .cse3 (_ bv12 32)))))))) (not (bvule (bvadd (_ bv4 32) .cse12 .cse3) .cse8)))))))))) is different from false [2023-11-23 20:36:53,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_710))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_709) .cse8 v_ArrVal_712))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (let ((.cse2 (bvadd .cse0 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse0 .cse1) .cse2)) (forall ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse7 .cse8 v_ArrVal_711) c_create_data_~data~0.base) .cse6))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store .cse5 .cse3 v_ArrVal_713) c_create_data_~data~0.base) .cse6))) (bvule (bvadd .cse4 .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse0)))))))))))))) (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_710))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_709) .cse15 v_ArrVal_712))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (bvadd .cse0 .cse9 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse0 .cse9) .cse10)) (forall ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store .cse14 .cse15 v_ArrVal_711))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (or (not (bvule .cse10 (select |c_#length| .cse11))) (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store .cse12 .cse11 v_ArrVal_713) c_create_data_~data~0.base) .cse6) .cse0) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_714) c_create_data_~data~0.base) .cse6))))))))))))))))) is different from false [2023-11-23 20:36:54,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse9 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_710))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_709) .cse8 v_ArrVal_712))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse6))) (let ((.cse2 (bvadd .cse0 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse0 .cse1) .cse2)) (forall ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store .cse7 .cse8 v_ArrVal_711) c_create_data_~data~0.base) .cse6))) (or (forall ((v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse4 .cse5 v_ArrVal_713) c_create_data_~data~0.base) .cse6))) (bvule (bvadd .cse3 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse3 .cse1)))) (not (bvule .cse2 (select |c_#length| .cse5))))))))))))) (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_710))) (let ((.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_709) .cse16 v_ArrVal_712))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (bvadd .cse10 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse10 .cse1) .cse11)) (forall ((v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_711))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (or (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store .cse12 .cse13 v_ArrVal_713) c_create_data_~data~0.base) .cse6) .cse1) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_714) c_create_data_~data~0.base) .cse6)))) (not (bvule .cse11 (select |c_#length| .cse13))))))))))))))))) is different from false