./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:52:26,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:52:26,283 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:52:26,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:52:26,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:52:26,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:52:26,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:52:26,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:52:26,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:52:26,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:52:26,347 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:52:26,347 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:52:26,347 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:52:26,349 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:52:26,350 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:52:26,350 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:52:26,350 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:52:26,351 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:52:26,353 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:52:26,354 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:52:26,354 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:52:26,355 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:52:26,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:52:26,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:52:26,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:52:26,360 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:52:26,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:52:26,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:52:26,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:52:26,361 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:52:26,362 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:52:26,363 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:52:26,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:52:26,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:52:26,363 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:52:26,363 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:52:26,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:52:26,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:52:26,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:52:26,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:26,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:52:26,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:52:26,365 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:52:26,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:52:26,366 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:52:26,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:52:26,366 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_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2023-11-12 00:52:26,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:52:26,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:52:26,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:52:26,712 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:52:26,713 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:52:26,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-12 00:52:29,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:52:30,127 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:52:30,128 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-12 00:52:30,147 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data/74c0c10c9/339d4e2846964a3a9009c5cf9ce9b4c3/FLAG6e3aa97fe [2023-11-12 00:52:30,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data/74c0c10c9/339d4e2846964a3a9009c5cf9ce9b4c3 [2023-11-12 00:52:30,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:52:30,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:52:30,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:30,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:52:30,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:52:30,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:30" (1/1) ... [2023-11-12 00:52:30,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5cd668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:30, skipping insertion in model container [2023-11-12 00:52:30,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:30" (1/1) ... [2023-11-12 00:52:30,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:52:30,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:30,607 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-12 00:52:30,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@524507b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:30, skipping insertion in model container [2023-11-12 00:52:30,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:30,608 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-12 00:52:30,611 INFO L158 Benchmark]: Toolchain (without parser) took 431.34ms. Allocated memory is still 140.5MB. Free memory was 109.2MB in the beginning and 96.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 00:52:30,611 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 140.5MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:30,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.76ms. Allocated memory is still 140.5MB. Free memory was 108.8MB in the beginning and 97.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 00:52:30,614 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.32ms. Allocated memory is still 140.5MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.76ms. Allocated memory is still 140.5MB. Free memory was 108.8MB in the beginning and 97.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:52:33,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:52:33,148 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-12 00:52:33,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:52:33,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:52:33,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:52:33,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:52:33,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:52:33,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:52:33,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:52:33,210 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:52:33,211 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:52:33,211 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:52:33,213 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:52:33,213 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:52:33,214 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:52:33,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:52:33,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:52:33,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:52:33,217 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:52:33,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:52:33,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:52:33,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:52:33,219 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:52:33,219 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:52:33,220 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:52:33,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:52:33,221 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:52:33,221 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 00:52:33,221 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 00:52:33,223 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:52:33,223 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:52:33,224 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:52:33,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:52:33,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 00:52:33,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:52:33,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:33,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:52:33,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:52:33,226 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-12 00:52:33,226 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 00:52:33,227 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:52:33,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:52:33,227 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_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2023-11-12 00:52:33,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:52:33,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:52:33,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:52:33,627 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:52:33,628 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:52:33,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-12 00:52:36,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:52:37,242 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:52:37,243 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-12 00:52:37,264 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data/f2dc2dbfc/2cd50072702949f9a693245fccb03409/FLAG629941c97 [2023-11-12 00:52:37,283 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/data/f2dc2dbfc/2cd50072702949f9a693245fccb03409 [2023-11-12 00:52:37,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:52:37,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:52:37,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:37,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:52:37,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:52:37,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:37,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6803af02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37, skipping insertion in model container [2023-11-12 00:52:37,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:37,354 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:52:37,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:37,832 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-12 00:52:37,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:52:37,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:37,884 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:52:37,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:37,993 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:52:37,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37 WrapperNode [2023-11-12 00:52:37,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:37,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:52:37,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:52:37,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:52:38,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,046 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2023-11-12 00:52:38,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:52:38,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:52:38,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:52:38,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:52:38,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:52:38,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:52:38,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:52:38,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:52:38,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (1/1) ... [2023-11-12 00:52:38,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:38,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:38,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:52:38,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:52:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:52:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:52:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:52:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:52:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:52:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:52:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 00:52:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:52:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 00:52:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:52:38,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:52:38,308 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:52:38,310 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:52:38,911 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:52:38,919 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:52:38,919 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:52:38,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:52:38 BoogieIcfgContainer [2023-11-12 00:52:38,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:52:38,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:52:38,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:52:38,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:52:38,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:52:37" (1/3) ... [2023-11-12 00:52:38,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5183fbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:52:38, skipping insertion in model container [2023-11-12 00:52:38,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:37" (2/3) ... [2023-11-12 00:52:38,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5183fbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:52:38, skipping insertion in model container [2023-11-12 00:52:38,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:52:38" (3/3) ... [2023-11-12 00:52:38,931 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2023-11-12 00:52:38,949 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:52:38,950 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-11-12 00:52:38,997 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:52:39,004 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;@606660c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:52:39,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-12 00:52:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 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-12 00:52:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:52:39,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:39,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:52:39,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:39,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2023-11-12 00:52:39,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669551841] [2023-11-12 00:52:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:39,031 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-12 00:52:39,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:39,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:39,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:39,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:52:39,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:39,221 INFO L351 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-12 00:52:39,302 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:52:39,303 INFO L351 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-12 00:52:39,336 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-12 00:52:39,336 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:39,337 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669551841] [2023-11-12 00:52:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669551841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:39,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:39,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:52:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514762440] [2023-11-12 00:52:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:39,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:52:39,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:52:39,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:39,393 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12 00:52:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:39,804 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2023-11-12 00:52:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:52:39,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12 00:52:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:39,814 INFO L225 Difference]: With dead ends: 107 [2023-11-12 00:52:39,814 INFO L226 Difference]: Without dead ends: 105 [2023-11-12 00:52:39,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 00:52:39,819 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 127 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:39,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 97 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:52:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-12 00:52:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2023-11-12 00:52:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 97 states have internal predecessors, (105), 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-12 00:52:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-11-12 00:52:39,873 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 4 [2023-11-12 00:52:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:39,874 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-11-12 00:52:39,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12 00:52:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-11-12 00:52:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:52:39,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:39,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:52:39,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:40,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:40,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:40,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2023-11-12 00:52:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:40,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390576773] [2023-11-12 00:52:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:40,080 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-12 00:52:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:40,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:40,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:40,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 00:52:40,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:40,189 INFO L351 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-12 00:52:40,202 INFO L351 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-12 00:52:40,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:40,266 INFO L351 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-12 00:52:40,286 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:52:40,287 INFO L351 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-12 00:52:40,309 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-12 00:52:40,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:40,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:40,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390576773] [2023-11-12 00:52:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390576773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:40,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:52:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478996019] [2023-11-12 00:52:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:52:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:52:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:40,315 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12 00:52:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:40,795 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2023-11-12 00:52:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:52:40,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12 00:52:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:40,798 INFO L225 Difference]: With dead ends: 145 [2023-11-12 00:52:40,798 INFO L226 Difference]: Without dead ends: 145 [2023-11-12 00:52:40,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 00:52:40,800 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 101 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:40,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 113 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:52:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-12 00:52:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 112. [2023-11-12 00:52:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 111 states have internal predecessors, (127), 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-12 00:52:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2023-11-12 00:52:40,827 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 4 [2023-11-12 00:52:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:40,828 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2023-11-12 00:52:40,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12 00:52:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2023-11-12 00:52:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:52:40,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:40,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:52:40,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:41,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:41,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:41,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2023-11-12 00:52:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861767264] [2023-11-12 00:52:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:41,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-12 00:52:41,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:41,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:41,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:41,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 00:52:41,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:41,135 INFO L351 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-12 00:52:41,145 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-12 00:52:41,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:41,146 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:41,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861767264] [2023-11-12 00:52:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861767264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:41,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:41,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:52:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082938536] [2023-11-12 00:52:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:41,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:52:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:52:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:52:41,152 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 00:52:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:41,317 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2023-11-12 00:52:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:52:41,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-12 00:52:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:41,319 INFO L225 Difference]: With dead ends: 110 [2023-11-12 00:52:41,319 INFO L226 Difference]: Without dead ends: 110 [2023-11-12 00:52:41,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 00:52:41,320 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 35 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:41,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 115 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-12 00:52:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-12 00:52:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 109 states have internal predecessors, (124), 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-12 00:52:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2023-11-12 00:52:41,339 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 5 [2023-11-12 00:52:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:41,340 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2023-11-12 00:52:41,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 00:52:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2023-11-12 00:52:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:52:41,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:41,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:52:41,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:41,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:41,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:41,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2023-11-12 00:52:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:41,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971776478] [2023-11-12 00:52:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:41,551 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-12 00:52:41,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:41,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:41,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:41,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:52:41,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:41,619 INFO L351 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-12 00:52:41,639 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-12 00:52:41,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:41,640 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971776478] [2023-11-12 00:52:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971776478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:41,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:41,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:52:41,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174533389] [2023-11-12 00:52:41,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:41,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:52:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:41,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:52:41,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:52:41,643 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 00:52:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:41,882 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-11-12 00:52:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:52:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-12 00:52:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:41,884 INFO L225 Difference]: With dead ends: 120 [2023-11-12 00:52:41,884 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 00:52:41,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 00:52:41,886 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:41,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 00:52:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2023-11-12 00:52:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 113 states have internal predecessors, (129), 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-12 00:52:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2023-11-12 00:52:41,895 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 5 [2023-11-12 00:52:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:41,895 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2023-11-12 00:52:41,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-12 00:52:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2023-11-12 00:52:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:52:41,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:41,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:41,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:42,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:42,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:42,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 234240077, now seen corresponding path program 1 times [2023-11-12 00:52:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013047028] [2023-11-12 00:52:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:42,110 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-12 00:52:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:42,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:42,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:42,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 00:52:42,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:42,196 INFO L351 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-12 00:52:42,205 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-12 00:52:42,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:42,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013047028] [2023-11-12 00:52:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013047028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:52:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807859364] [2023-11-12 00:52:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:42,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:52:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:42,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:52:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:52:42,208 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-12 00:52:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:42,371 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2023-11-12 00:52:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:52:42,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2023-11-12 00:52:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:42,373 INFO L225 Difference]: With dead ends: 110 [2023-11-12 00:52:42,373 INFO L226 Difference]: Without dead ends: 110 [2023-11-12 00:52:42,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-12 00:52:42,374 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:42,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 122 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-12 00:52:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-12 00:52:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 109 states have internal predecessors, (124), 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-12 00:52:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2023-11-12 00:52:42,382 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 9 [2023-11-12 00:52:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:42,383 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2023-11-12 00:52:42,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-12 00:52:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2023-11-12 00:52:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:52:42,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:42,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:42,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:42,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:42,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:42,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash 234240078, now seen corresponding path program 1 times [2023-11-12 00:52:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142071481] [2023-11-12 00:52:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:42,604 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-12 00:52:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:42,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:42,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:42,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:52:42,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:42,711 INFO L351 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-12 00:52:42,731 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-12 00:52:42,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:42,731 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:42,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142071481] [2023-11-12 00:52:42,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142071481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:42,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:42,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:52:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848186136] [2023-11-12 00:52:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:42,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:52:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:52:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:52:42,734 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-12 00:52:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:42,959 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2023-11-12 00:52:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:52:42,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2023-11-12 00:52:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:42,960 INFO L225 Difference]: With dead ends: 109 [2023-11-12 00:52:42,960 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 00:52:42,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-12 00:52:42,962 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:42,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 141 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 00:52:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-12 00:52:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 108 states have internal predecessors, (122), 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-12 00:52:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2023-11-12 00:52:42,968 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 9 [2023-11-12 00:52:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:42,969 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2023-11-12 00:52:42,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-12 00:52:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2023-11-12 00:52:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:52:42,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:42,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:42,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:43,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2023-11-12 00:52:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:43,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657837970] [2023-11-12 00:52:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:43,188 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-12 00:52:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:43,189 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:43,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:52:43,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:43,302 INFO L351 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-12 00:52:43,309 INFO L351 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-12 00:52:43,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:43,350 INFO L351 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-12 00:52:43,361 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:52:43,362 INFO L351 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-12 00:52:43,385 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-12 00:52:43,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:43,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:43,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657837970] [2023-11-12 00:52:43,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657837970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:43,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:43,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:52:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805188181] [2023-11-12 00:52:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:43,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:52:43,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:52:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:43,388 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-12 00:52:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:43,565 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2023-11-12 00:52:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:52:43,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-11-12 00:52:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:43,567 INFO L225 Difference]: With dead ends: 106 [2023-11-12 00:52:43,567 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 00:52:43,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:43,568 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:43,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 124 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 00:52:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-12 00:52:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 105 states have internal predecessors, (119), 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-12 00:52:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-11-12 00:52:43,574 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 9 [2023-11-12 00:52:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:43,575 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-11-12 00:52:43,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-12 00:52:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-11-12 00:52:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:52:43,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:43,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:43,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:43,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2023-11-12 00:52:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310216907] [2023-11-12 00:52:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:43,789 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-12 00:52:43,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:43,791 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:43,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:52:43,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:43,920 INFO L351 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-12 00:52:43,952 INFO L351 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-12 00:52:43,983 INFO L351 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-12 00:52:44,003 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-12 00:52:44,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:44,003 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:44,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310216907] [2023-11-12 00:52:44,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310216907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:44,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:44,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:52:44,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130235553] [2023-11-12 00:52:44,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:44,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:52:44,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:44,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:52:44,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:44,005 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12 00:52:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:44,411 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2023-11-12 00:52:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:52:44,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-11-12 00:52:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:44,412 INFO L225 Difference]: With dead ends: 116 [2023-11-12 00:52:44,413 INFO L226 Difference]: Without dead ends: 116 [2023-11-12 00:52:44,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:52:44,414 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:44,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 234 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:52:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-12 00:52:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-11-12 00:52:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 109 states have internal predecessors, (125), 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-12 00:52:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2023-11-12 00:52:44,420 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 14 [2023-11-12 00:52:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:44,420 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2023-11-12 00:52:44,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12 00:52:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2023-11-12 00:52:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:52:44,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:44,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:44,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:44,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:44,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:44,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:44,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2023-11-12 00:52:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:44,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476855831] [2023-11-12 00:52:44,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:44,647 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-12 00:52:44,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:44,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:44,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:44,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:52:44,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:44,765 INFO L351 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-12 00:52:44,786 INFO L351 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-12 00:52:44,792 INFO L351 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-12 00:52:44,895 INFO L351 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-12 00:52:44,937 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-12 00:52:44,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:44,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:44,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476855831] [2023-11-12 00:52:44,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476855831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:44,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:44,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:52:44,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794282185] [2023-11-12 00:52:44,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:44,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:52:44,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:44,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:52:44,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:52:44,939 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-12 00:52:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:45,368 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2023-11-12 00:52:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:52:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2023-11-12 00:52:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:45,370 INFO L225 Difference]: With dead ends: 111 [2023-11-12 00:52:45,371 INFO L226 Difference]: Without dead ends: 111 [2023-11-12 00:52:45,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:52:45,372 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:45,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:52:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-12 00:52:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2023-11-12 00:52:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 109 states have internal predecessors, (123), 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-12 00:52:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2023-11-12 00:52:45,377 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 14 [2023-11-12 00:52:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:45,378 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2023-11-12 00:52:45,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-12 00:52:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2023-11-12 00:52:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:52:45,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:45,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:45,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:45,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:45,590 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:45,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash 330082961, now seen corresponding path program 1 times [2023-11-12 00:52:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609616279] [2023-11-12 00:52:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:45,591 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-12 00:52:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:45,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:45,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:45,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:52:45,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:45,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:52:45,861 INFO L351 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-12 00:52:45,879 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:52:45,879 INFO L351 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-12 00:52:45,944 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-12 00:52:45,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:45,945 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609616279] [2023-11-12 00:52:45,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609616279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:45,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:52:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512065339] [2023-11-12 00:52:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:45,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:52:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:45,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:52:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:52:45,947 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-12 00:52:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:46,207 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2023-11-12 00:52:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:52:46,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2023-11-12 00:52:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:46,209 INFO L225 Difference]: With dead ends: 109 [2023-11-12 00:52:46,209 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 00:52:46,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:52:46,210 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 108 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:46,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 179 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 00:52:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2023-11-12 00:52:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 104 states have internal predecessors, (118), 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-12 00:52:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2023-11-12 00:52:46,215 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 16 [2023-11-12 00:52:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:46,216 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2023-11-12 00:52:46,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-12 00:52:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2023-11-12 00:52:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:52:46,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:46,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:46,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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)] Ended with exit code 0 [2023-11-12 00:52:46,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:46,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:46,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash -475614716, now seen corresponding path program 1 times [2023-11-12 00:52:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60554323] [2023-11-12 00:52:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:46,430 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-12 00:52:46,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:46,431 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:46,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:46,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-12 00:52:46,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:46,644 INFO L351 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 15 treesize of output 1 [2023-11-12 00:52:46,671 INFO L351 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 16 treesize of output 8 [2023-11-12 00:52:46,681 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-12 00:52:46,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:46,682 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60554323] [2023-11-12 00:52:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60554323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:46,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:52:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425761620] [2023-11-12 00:52:46,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:46,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:52:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:52:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:46,684 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-12 00:52:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:46,975 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2023-11-12 00:52:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:52:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-11-12 00:52:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:46,976 INFO L225 Difference]: With dead ends: 144 [2023-11-12 00:52:46,977 INFO L226 Difference]: Without dead ends: 144 [2023-11-12 00:52:46,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:52:46,978 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 70 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:46,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 234 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:52:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-12 00:52:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2023-11-12 00:52:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 104 states have internal predecessors, (117), 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-12 00:52:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-11-12 00:52:46,982 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2023-11-12 00:52:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:46,982 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-11-12 00:52:46,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-12 00:52:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-11-12 00:52:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:52:46,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:46,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:47,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:47,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:47,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:47,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash -475614743, now seen corresponding path program 1 times [2023-11-12 00:52:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:47,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056674257] [2023-11-12 00:52:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:47,188 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-12 00:52:47,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:47,189 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:47,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:47,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-12 00:52:47,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:47,322 INFO L351 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-12 00:52:47,501 INFO L351 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 11 treesize of output 7 [2023-11-12 00:52:47,513 INFO L351 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 15 treesize of output 1 [2023-11-12 00:52:47,576 INFO L351 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 17 treesize of output 9 [2023-11-12 00:52:47,599 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-12 00:52:47,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:47,599 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056674257] [2023-11-12 00:52:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056674257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:47,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:47,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:52:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714513760] [2023-11-12 00:52:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:47,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:52:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:47,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:52:47,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:47,601 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-12 00:52:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:48,100 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2023-11-12 00:52:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:52:48,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-11-12 00:52:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:48,102 INFO L225 Difference]: With dead ends: 159 [2023-11-12 00:52:48,102 INFO L226 Difference]: Without dead ends: 159 [2023-11-12 00:52:48,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:52:48,103 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:48,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 214 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:52:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-12 00:52:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 114. [2023-11-12 00:52:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 113 states have internal predecessors, (128), 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-12 00:52:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2023-11-12 00:52:48,108 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 18 [2023-11-12 00:52:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:48,108 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2023-11-12 00:52:48,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-12 00:52:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2023-11-12 00:52:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:52:48,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:48,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:48,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:48,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:48,318 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:48,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -475614744, now seen corresponding path program 1 times [2023-11-12 00:52:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921650909] [2023-11-12 00:52:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:48,319 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-12 00:52:48,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:48,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:48,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (14)] Waiting until timeout for monitored process [2023-11-12 00:52:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:48,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:52:48,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:48,425 INFO L351 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-12 00:52:48,539 INFO L351 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 15 treesize of output 1 [2023-11-12 00:52:48,571 INFO L351 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 19 treesize of output 11 [2023-11-12 00:52:48,582 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-12 00:52:48,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:48,582 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:48,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921650909] [2023-11-12 00:52:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921650909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:48,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:52:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672540089] [2023-11-12 00:52:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:48,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:52:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:48,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:52:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:48,585 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-12 00:52:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:48,989 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2023-11-12 00:52:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:52:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-11-12 00:52:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:48,991 INFO L225 Difference]: With dead ends: 145 [2023-11-12 00:52:48,991 INFO L226 Difference]: Without dead ends: 145 [2023-11-12 00:52:48,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:52:48,992 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:48,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 175 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:52:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-12 00:52:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2023-11-12 00:52:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 113 states have internal predecessors, (126), 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-12 00:52:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2023-11-12 00:52:48,996 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 18 [2023-11-12 00:52:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:48,997 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2023-11-12 00:52:48,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-12 00:52:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2023-11-12 00:52:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:52:48,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:48,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:49,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (14)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:49,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:49,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:49,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -764326860, now seen corresponding path program 1 times [2023-11-12 00:52:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:49,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339600790] [2023-11-12 00:52:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:49,200 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-12 00:52:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:49,201 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (15)] Waiting until timeout for monitored process [2023-11-12 00:52:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:49,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 00:52:49,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:49,390 INFO L351 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-12 00:52:49,427 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-12 00:52:49,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-12 00:52:49,466 INFO L351 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-12 00:52:49,616 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:52:49,616 INFO L351 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-12 00:52:49,677 INFO L351 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-12 00:52:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:52:49,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:51,876 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_267) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-12 00:52:51,908 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:52:51,909 INFO L351 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-12 00:52:51,920 INFO L351 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-12 00:52:51,936 INFO L351 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-12 00:52:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:52:54,029 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:52:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339600790] [2023-11-12 00:52:54,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339600790] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1188841046] [2023-11-12 00:52:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 00:52:54,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 [2023-11-12 00:52:54,032 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 00:52:54,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-11-12 00:52:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:54,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-12 00:52:54,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:54,300 INFO L351 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-12 00:52:54,339 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-12 00:52:54,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-12 00:52:54,378 INFO L351 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-12 00:52:54,497 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:52:54,498 INFO L351 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-12 00:52:54,566 INFO L351 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-12 00:52:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:52:54,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:54,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|)))))) is different from false [2023-11-12 00:52:54,665 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_307) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) is different from false [2023-11-12 00:52:54,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:52:54,691 INFO L351 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-12 00:52:54,694 INFO L351 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-12 00:52:54,702 INFO L351 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-12 00:52:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:52:54,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1188841046] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:54,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628665788] [2023-11-12 00:52:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:54,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:54,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:54,757 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:54,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-12 00:52:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:54,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:52:54,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:54,880 INFO L351 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-12 00:52:54,921 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-12 00:52:54,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-12 00:52:54,952 INFO L351 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-12 00:52:55,066 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:52:55,067 INFO L351 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-12 00:52:55,133 INFO L351 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-12 00:52:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:52:55,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:55,218 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_346) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-12 00:52:57,343 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:52:57,343 INFO L351 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-12 00:52:57,348 INFO L351 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-12 00:52:57,353 INFO L351 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-12 00:52:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:52:57,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628665788] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:57,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-12 00:52:57,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7, 6, 7] total 16 [2023-11-12 00:52:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964993534] [2023-11-12 00:52:57,410 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:57,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:52:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:52:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:52:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=116, Unknown=8, NotChecked=100, Total=272 [2023-11-12 00:52:57,412 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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-12 00:52:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:58,334 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-11-12 00:52:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:52:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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 20 [2023-11-12 00:52:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:58,338 INFO L225 Difference]: With dead ends: 114 [2023-11-12 00:52:58,338 INFO L226 Difference]: Without dead ends: 114 [2023-11-12 00:52:58,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=57, Invalid=133, Unknown=8, NotChecked=108, Total=306 [2023-11-12 00:52:58,339 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 19 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:58,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 538 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 210 Unchecked, 0.8s Time] [2023-11-12 00:52:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-12 00:52:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2023-11-12 00:52:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 112 states have internal predecessors, (125), 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-12 00:52:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-11-12 00:52:58,342 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 20 [2023-11-12 00:52:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:58,343 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-11-12 00:52:58,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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-12 00:52:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-11-12 00:52:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:52:58,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:58,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:58,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (15)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:58,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:58,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:58,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:58,957 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:52:58,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash -764326859, now seen corresponding path program 1 times [2023-11-12 00:52:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:52:58,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431756407] [2023-11-12 00:52:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:58,958 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-12 00:52:58,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:52:58,959 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:52:58,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (18)] Waiting until timeout for monitored process [2023-11-12 00:52:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:59,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-12 00:52:59,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:59,138 INFO L351 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-12 00:52:59,173 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:52:59,173 INFO L351 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-12 00:52:59,184 INFO L351 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 6 treesize of output 5 [2023-11-12 00:52:59,229 INFO L351 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-12 00:52:59,240 INFO L351 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-12 00:52:59,469 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:52:59,470 INFO L351 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-12 00:52:59,487 INFO L351 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-12 00:52:59,613 INFO L351 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-12 00:52:59,619 INFO L351 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-12 00:52:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:52:59,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:00,093 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_386) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_387 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_386) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_387) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2023-11-12 00:53:00,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_386) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_387 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_386) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_387) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2023-11-12 00:53:00,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_386) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_387 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_386) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_387) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2023-11-12 00:53:00,271 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:00,272 INFO L351 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 46 [2023-11-12 00:53:00,284 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:00,284 INFO L351 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 35 treesize of output 36 [2023-11-12 00:53:00,294 INFO L351 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 62 treesize of output 50 [2023-11-12 00:53:00,299 INFO L351 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 96 treesize of output 78 [2023-11-12 00:53:00,319 INFO L351 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 15 treesize of output 11 [2023-11-12 00:53:00,324 INFO L351 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-12 00:53:00,346 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:00,347 INFO L351 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-12 00:53:00,358 INFO L351 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-12 00:53:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:00,472 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431756407] [2023-11-12 00:53:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431756407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1025956271] [2023-11-12 00:53:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:00,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 00:53:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 [2023-11-12 00:53:00,474 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 00:53:00,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-11-12 00:53:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:00,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-12 00:53:00,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:00,743 INFO L351 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-12 00:53:00,763 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:00,764 INFO L351 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-12 00:53:00,774 INFO L351 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 6 treesize of output 5 [2023-11-12 00:53:00,789 INFO L351 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-12 00:53:00,803 INFO L351 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-12 00:53:00,947 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:00,947 INFO L351 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-12 00:53:00,955 INFO L351 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-12 00:53:01,077 INFO L351 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-12 00:53:01,085 INFO L351 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-12 00:53:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:01,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:01,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_428) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2023-11-12 00:53:01,359 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_428) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2023-11-12 00:53:01,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_428) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2023-11-12 00:53:01,461 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:01,462 INFO L351 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-12 00:53:01,465 INFO L351 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-12 00:53:01,504 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:01,504 INFO L351 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-12 00:53:01,527 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:01,527 INFO L351 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-12 00:53:01,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:01,539 INFO L351 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-12 00:53:01,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:01,549 INFO L351 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-12 00:53:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1025956271] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880610964] [2023-11-12 00:53:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:01,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:01,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:01,569 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:01,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-12 00:53:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:01,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-12 00:53:01,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:01,728 INFO L351 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-12 00:53:01,743 INFO L351 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-12 00:53:01,763 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:01,763 INFO L351 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-12 00:53:01,779 INFO L351 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-12 00:53:01,785 INFO L351 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-12 00:53:01,950 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:01,951 INFO L351 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-12 00:53:01,969 INFO L351 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-12 00:53:02,062 INFO L351 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-12 00:53:02,070 INFO L351 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-12 00:53:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:02,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:02,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2023-11-12 00:53:02,331 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2023-11-12 00:53:02,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-12 00:53:02,422 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:02,422 INFO L351 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 46 [2023-11-12 00:53:02,435 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:02,435 INFO L351 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 35 treesize of output 36 [2023-11-12 00:53:02,442 INFO L351 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 62 treesize of output 50 [2023-11-12 00:53:02,446 INFO L351 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 96 treesize of output 78 [2023-11-12 00:53:02,462 INFO L351 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 15 treesize of output 11 [2023-11-12 00:53:02,467 INFO L351 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-12 00:53:02,493 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:02,493 INFO L351 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-12 00:53:02,504 INFO L351 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-12 00:53:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880610964] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:02,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-12 00:53:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 21 [2023-11-12 00:53:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402393322] [2023-11-12 00:53:02,536 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:02,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 00:53:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 00:53:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=130, Unknown=9, NotChecked=270, Total=462 [2023-11-12 00:53:02,538 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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-12 00:53:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:05,059 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2023-11-12 00:53:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:53:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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 20 [2023-11-12 00:53:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:05,061 INFO L225 Difference]: With dead ends: 121 [2023-11-12 00:53:05,061 INFO L226 Difference]: Without dead ends: 121 [2023-11-12 00:53:05,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=335, Unknown=9, NotChecked=414, Total=870 [2023-11-12 00:53:05,062 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 33 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:05,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 873 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 507 Unchecked, 1.7s Time] [2023-11-12 00:53:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-12 00:53:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-11-12 00:53:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.423913043478261) internal successors, (131), 118 states have internal predecessors, (131), 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-12 00:53:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-12 00:53:05,067 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 20 [2023-11-12 00:53:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:05,067 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-12 00:53:05,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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-12 00:53:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-12 00:53:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:53:05,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:05,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:05,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (18)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:05,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-11-12 00:53:05,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:05,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:05,678 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:53:05,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash 58337566, now seen corresponding path program 1 times [2023-11-12 00:53:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:05,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791183754] [2023-11-12 00:53:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:05,680 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-12 00:53:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:05,681 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:05,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (21)] Waiting until timeout for monitored process [2023-11-12 00:53:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:05,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:53:05,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:05,806 INFO L351 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-12 00:53:05,916 INFO L351 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 15 treesize of output 1 [2023-11-12 00:53:05,959 INFO L351 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 19 treesize of output 11 [2023-11-12 00:53:05,970 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-12 00:53:05,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:05,970 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791183754] [2023-11-12 00:53:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791183754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:05,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484855669] [2023-11-12 00:53:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:05,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:05,972 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 00:53:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:06,412 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2023-11-12 00:53:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:53:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2023-11-12 00:53:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:06,413 INFO L225 Difference]: With dead ends: 155 [2023-11-12 00:53:06,413 INFO L226 Difference]: Without dead ends: 155 [2023-11-12 00:53:06,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:53:06,414 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 96 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:06,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 173 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:53:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-12 00:53:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 119. [2023-11-12 00:53:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 118 states have internal predecessors, (130), 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-12 00:53:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2023-11-12 00:53:06,421 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 21 [2023-11-12 00:53:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:06,422 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2023-11-12 00:53:06,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 00:53:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2023-11-12 00:53:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:53:06,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:06,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:06,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (21)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:06,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:06,636 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:53:06,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 58337567, now seen corresponding path program 1 times [2023-11-12 00:53:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010159385] [2023-11-12 00:53:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:06,637 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-12 00:53:06,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:06,638 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:06,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:06,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-12 00:53:06,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:06,776 INFO L351 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-12 00:53:06,939 INFO L351 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 11 treesize of output 7 [2023-11-12 00:53:06,951 INFO L351 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 15 treesize of output 1 [2023-11-12 00:53:07,049 INFO L351 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 17 treesize of output 9 [2023-11-12 00:53:07,070 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-12 00:53:07,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:07,070 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010159385] [2023-11-12 00:53:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010159385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:07,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233282924] [2023-11-12 00:53:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:07,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:07,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:07,072 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 00:53:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:07,644 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2023-11-12 00:53:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:07,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2023-11-12 00:53:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:07,646 INFO L225 Difference]: With dead ends: 161 [2023-11-12 00:53:07,646 INFO L226 Difference]: Without dead ends: 161 [2023-11-12 00:53:07,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:53:07,647 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 69 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:07,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 213 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:53:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-12 00:53:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2023-11-12 00:53:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.4) internal successors, (133), 121 states have internal predecessors, (133), 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-12 00:53:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2023-11-12 00:53:07,651 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 21 [2023-11-12 00:53:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:07,652 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2023-11-12 00:53:07,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 00:53:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2023-11-12 00:53:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:53:07,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:07,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:07,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:07,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:07,865 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:53:07,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1527252530, now seen corresponding path program 1 times [2023-11-12 00:53:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:07,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749588053] [2023-11-12 00:53:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:07,867 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-12 00:53:07,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:07,869 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:07,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (23)] Waiting until timeout for monitored process [2023-11-12 00:53:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:08,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 00:53:08,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:08,038 INFO L351 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-12 00:53:08,074 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:08,074 INFO L351 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-12 00:53:08,244 INFO L351 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 11 treesize of output 7 [2023-11-12 00:53:08,265 INFO L351 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 11 treesize of output 7 [2023-11-12 00:53:08,349 INFO L351 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 31 treesize of output 19 [2023-11-12 00:53:08,362 INFO L351 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 31 treesize of output 19 [2023-11-12 00:53:08,652 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-12 00:53:08,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:08,652 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:08,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749588053] [2023-11-12 00:53:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749588053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:08,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 00:53:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034871396] [2023-11-12 00:53:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:08,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:53:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:53:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:53:08,654 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-12 00:53:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:10,384 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2023-11-12 00:53:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:53:10,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 24 [2023-11-12 00:53:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:10,386 INFO L225 Difference]: With dead ends: 159 [2023-11-12 00:53:10,386 INFO L226 Difference]: Without dead ends: 159 [2023-11-12 00:53:10,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-11-12 00:53:10,387 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 150 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:10,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 296 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-12 00:53:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-12 00:53:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2023-11-12 00:53:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 137 states have internal predecessors, (150), 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-12 00:53:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2023-11-12 00:53:10,392 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 24 [2023-11-12 00:53:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:10,393 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2023-11-12 00:53:10,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-12 00:53:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2023-11-12 00:53:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:53:10,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:10,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:10,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (23)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:10,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:10,609 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:53:10,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1189100778, now seen corresponding path program 1 times [2023-11-12 00:53:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:10,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573018257] [2023-11-12 00:53:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:10,610 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-12 00:53:10,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:10,611 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:10,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (24)] Waiting until timeout for monitored process [2023-11-12 00:53:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:10,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-12 00:53:10,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:10,852 INFO L351 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 11 treesize of output 7 [2023-11-12 00:53:10,927 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-12 00:53:10,927 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:53:10,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:10,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573018257] [2023-11-12 00:53:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573018257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:53:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812982639] [2023-11-12 00:53:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:10,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:53:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:53:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:53:10,929 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12 00:53:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:11,278 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2023-11-12 00:53:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:53:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2023-11-12 00:53:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:11,281 INFO L225 Difference]: With dead ends: 171 [2023-11-12 00:53:11,281 INFO L226 Difference]: Without dead ends: 171 [2023-11-12 00:53:11,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:53:11,282 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 63 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:11,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 231 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:53:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-12 00:53:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 150. [2023-11-12 00:53:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 149 states have internal predecessors, (175), 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-12 00:53:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2023-11-12 00:53:11,288 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 26 [2023-11-12 00:53:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:11,289 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2023-11-12 00:53:11,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12 00:53:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2023-11-12 00:53:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:53:11,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:11,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:11,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (24)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:11,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:11,491 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-12 00:53:11,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:11,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1517665639, now seen corresponding path program 2 times [2023-11-12 00:53:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:53:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275465158] [2023-11-12 00:53:11,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 00:53:11,492 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-12 00:53:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:53:11,493 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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-12 00:53:11,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/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 (25)] Waiting until timeout for monitored process [2023-11-12 00:53:11,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 00:53:11,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:53:11,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-12 00:53:11,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:11,788 INFO L351 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-12 00:53:11,804 INFO L351 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-12 00:53:11,823 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:11,823 INFO L351 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-12 00:53:11,859 INFO L351 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-12 00:53:11,870 INFO L351 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-12 00:53:12,064 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:12,064 INFO L351 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-12 00:53:12,078 INFO L351 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-12 00:53:12,320 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:12,320 INFO L351 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-12 00:53:12,332 INFO L351 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-12 00:53:12,450 INFO L351 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-12 00:53:12,455 INFO L351 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-12 00:53:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:12,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:14,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_630))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse0 (bvadd (_ bv8 32) .cse2 .cse7))) (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_631) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse4 .cse1 v_ArrVal_632) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse7) .cse0))))))) (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_630))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse9 (bvadd (_ bv8 32) .cse2 .cse8))) (or (not (bvule (bvadd (_ bv4 32) .cse2 .cse8) .cse9)) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_631))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse9 (select |c_#length| .cse10))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse2 (select (select (store .cse11 .cse10 v_ArrVal_632) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse12 .cse10 v_ArrVal_633) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))))))))))))))) is different from false [2023-11-12 00:53:15,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_630))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse1 (bvadd (_ bv8 32) .cse0))) (or (not (bvule (bvadd (_ bv4 32) .cse0) .cse1)) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_631))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule .cse1 (select |c_#length| .cse2))) (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_633 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse3 .cse2 v_ArrVal_632) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_633) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_630))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse8 (bvadd (_ bv8 32) .cse7))) (or (not (bvule (bvadd (_ bv4 32) .cse7) .cse8)) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_631) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store .cse10 .cse11 v_ArrVal_632) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) .cse9) (bvadd .cse9 (_ bv12 32))))) (not (bvule .cse8 (select |c_#length| .cse11)))))))))))))) is different from false [2023-11-12 00:53:15,238 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:15,239 INFO L351 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 182 treesize of output 152 [2023-11-12 00:53:15,265 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:15,266 INFO L351 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 116 treesize of output 86 [2023-11-12 00:53:15,283 INFO L351 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 402 treesize of output 330 [2023-11-12 00:53:15,296 INFO L351 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 644 treesize of output 584 [2023-11-12 00:53:15,336 INFO L351 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 52 treesize of output 48 [2023-11-12 00:53:15,357 INFO L351 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 44 [2023-11-12 00:53:15,379 INFO L351 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 79 treesize of output 63 [2023-11-12 00:53:15,388 INFO L351 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 97 treesize of output 81 [2023-11-12 00:53:15,738 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:15,738 INFO L351 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 182 treesize of output 142 [2023-11-12 00:53:15,774 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:15,774 INFO L351 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 106 treesize of output 86 [2023-11-12 00:53:15,805 INFO L351 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 156 treesize of output 132 [2023-11-12 00:53:15,834 INFO L351 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 310 treesize of output 256 [2023-11-12 00:53:15,869 INFO L351 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 87 treesize of output 75 [2023-11-12 00:53:15,884 INFO L351 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 109 treesize of output 89 [2023-11-12 00:53:15,915 INFO L351 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 36 treesize of output 28 [2023-11-12 00:53:17,773 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:17,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 264 treesize of output 367 [2023-11-12 00:53:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:53:18,651 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:53:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275465158] [2023-11-12 00:53:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275465158] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [26150061] [2023-11-12 00:53:18,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 00:53:18,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 00:53:18,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 [2023-11-12 00:53:18,654 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 00:53:18,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-12 00:53:19,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 00:53:19,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:53:19,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:53:19,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:19,067 INFO L351 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-12 00:53:19,092 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:19,092 INFO L351 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-12 00:53:19,102 INFO L351 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 6 treesize of output 5 [2023-11-12 00:53:19,123 INFO L351 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-12 00:53:19,140 INFO L351 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-12 00:53:19,269 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:19,270 INFO L351 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-12 00:53:19,283 INFO L351 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-12 00:53:19,587 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:19,588 INFO L351 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-12 00:53:19,605 INFO L351 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-12 00:53:19,702 INFO L351 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-12 00:53:19,709 INFO L351 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-12 00:53:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:19,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:19,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_691) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2023-11-12 00:53:20,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_691) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2023-11-12 00:53:20,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_691) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:20,292 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_690))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_689) .cse0 v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_691) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_689) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_690) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-12 00:53:20,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_690))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_689) .cse1 v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_691) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_689) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_690) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32) .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:20,589 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_690))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_689) .cse1 v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_691) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_689) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_690) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_692) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:20,617 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:20,617 INFO L351 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-12 00:53:20,634 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:20,634 INFO L351 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-12 00:53:20,643 INFO L351 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-12 00:53:20,649 INFO L351 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-12 00:53:20,683 INFO L351 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-12 00:53:20,697 INFO L351 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-12 00:53:20,708 INFO L351 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-12 00:53:20,736 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:20,737 INFO L351 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-12 00:53:20,776 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:20,777 INFO L351 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-12 00:53:20,802 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:20,808 INFO L351 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-12 00:53:20,814 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:20,819 INFO L351 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-12 00:53:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-11-12 00:53:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [26150061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760428715] [2023-11-12 00:53:21,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 00:53:21,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:21,121 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:21,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43538309-1044-4c1e-a2df-3335872f16c1/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-12 00:53:21,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 00:53:21,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:53:21,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-12 00:53:21,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:21,377 INFO L351 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-12 00:53:21,392 INFO L351 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-12 00:53:21,411 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-12 00:53:21,411 INFO L351 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-12 00:53:21,434 INFO L351 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-12 00:53:21,460 INFO L351 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-12 00:53:21,621 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:21,622 INFO L351 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-12 00:53:21,642 INFO L351 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-12 00:53:21,855 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-12 00:53:21,856 INFO L351 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-12 00:53:21,866 INFO L351 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-12 00:53:21,979 INFO L351 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-12 00:53:21,986 INFO L351 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-12 00:53:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:22,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:22,202 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_750) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2023-11-12 00:53:22,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_750) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-12 00:53:22,400 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_750) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:22,511 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_748) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_747) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_747))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_748) .cse3 v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_750) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) is different from false [2023-11-12 00:53:22,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_748) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_747) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_747))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_748) .cse4 v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_750) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2023-11-12 00:53:22,732 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_747))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_748) .cse1 v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_750) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_748) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_747) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_749) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-12 00:53:22,766 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:22,767 INFO L351 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-12 00:53:22,784 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:22,784 INFO L351 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-12 00:53:22,792 INFO L351 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-12 00:53:22,813 INFO L351 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-12 00:53:22,819 INFO L351 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-12 00:53:22,834 INFO L351 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-12 00:53:22,845 INFO L351 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-12 00:53:22,882 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:22,882 INFO L351 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-12 00:53:22,905 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:53:22,905 INFO L351 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-12 00:53:22,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:22,917 INFO L351 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-12 00:53:22,923 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:53:22,927 INFO L351 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-12 00:53:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-11-12 00:53:22,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760428715] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:22,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-11-12 00:53:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10, 12, 10, 12] total 34 [2023-11-12 00:53:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436577981] [2023-11-12 00:53:22,945 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:22,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-12 00:53:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:53:22,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-12 00:53:22,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=343, Unknown=21, NotChecked=714, Total=1190 [2023-11-12 00:53:22,950 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 35 states have internal predecessors, (73), 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)