./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh --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 e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:52:27,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:52:27,530 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 18:52:27,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:52:27,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:52:27,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:52:27,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:52:27,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:52:27,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:52:27,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:52:27,564 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:52:27,564 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:52:27,565 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:52:27,565 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:52:27,565 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:52:27,566 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:52:27,566 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:52:27,567 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:52:27,567 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:52:27,568 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:52:27,568 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:52:27,569 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:52:27,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:52:27,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:52:27,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:52:27,571 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:52:27,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:52:27,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:52:27,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:52:27,572 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:52:27,573 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:52:27,573 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:52:27,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:52:27,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:52:27,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:52:27,574 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:52:27,575 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:52:27,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:52:27,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:52:27,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:52:27,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:52:27,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:52:27,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:52:27,576 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:52:27,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:52:27,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:52:27,577 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:52:27,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:52:27,577 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_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh 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 -> e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd [2023-12-02 18:52:27,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:52:27,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:52:27,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:52:27,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:52:27,814 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:52:27,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2023-12-02 18:52:30,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:52:30,818 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:52:30,818 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2023-12-02 18:52:30,836 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data/1b4209a13/4bdf1c15b8fd43b2a62d61a200a906dc/FLAG3825904b0 [2023-12-02 18:52:30,846 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data/1b4209a13/4bdf1c15b8fd43b2a62d61a200a906dc [2023-12-02 18:52:30,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:52:30,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:52:30,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:52:30,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:52:30,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:52:30,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:52:30" (1/1) ... [2023-12-02 18:52:30,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4052b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:30, skipping insertion in model container [2023-12-02 18:52:30,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:52:30" (1/1) ... [2023-12-02 18:52:30,922 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:52:31,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:52:31,380 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-12-02 18:52:31,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b320bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:31, skipping insertion in model container [2023-12-02 18:52:31,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:52:31,381 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 18:52:31,383 INFO L158 Benchmark]: Toolchain (without parser) took 533.37ms. Allocated memory is still 140.5MB. Free memory was 108.8MB in the beginning and 87.4MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 18:52:31,383 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:52:31,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.45ms. Allocated memory is still 140.5MB. Free memory was 108.8MB in the beginning and 87.4MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 18:52:31,385 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.14ms. Allocated memory is still 111.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.45ms. Allocated memory is still 140.5MB. Free memory was 108.8MB in the beginning and 87.4MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh --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 e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:52:33,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:52:33,118 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 18:52:33,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:52:33,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:52:33,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:52:33,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:52:33,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:52:33,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:52:33,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:52:33,155 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:52:33,155 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:52:33,156 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:52:33,156 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:52:33,157 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:52:33,157 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:52:33,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:52:33,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:52:33,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:52:33,159 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:52:33,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:52:33,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:52:33,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:52:33,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:52:33,162 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:52:33,162 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:52:33,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:52:33,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:52:33,164 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 18:52:33,164 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 18:52:33,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:52:33,165 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:52:33,165 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:52:33,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:52:33,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 18:52:33,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:52:33,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:52:33,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:52:33,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:52:33,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:52:33,167 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 18:52:33,167 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 18:52:33,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:52:33,168 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:52:33,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:52:33,168 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_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh 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 -> e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd [2023-12-02 18:52:33,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:52:33,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:52:33,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:52:33,473 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:52:33,473 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:52:33,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2023-12-02 18:52:36,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:52:36,590 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:52:36,590 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2023-12-02 18:52:36,609 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data/c662749c1/bf0b219d58dd4b939600218dbd0d67e8/FLAGe744d32cd [2023-12-02 18:52:36,623 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/data/c662749c1/bf0b219d58dd4b939600218dbd0d67e8 [2023-12-02 18:52:36,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:52:36,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:52:36,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:52:36,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:52:36,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:52:36,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:52:36" (1/1) ... [2023-12-02 18:52:36,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7c4fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:36, skipping insertion in model container [2023-12-02 18:52:36,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:52:36" (1/1) ... [2023-12-02 18:52:36,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:52:37,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:52:37,243 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 18:52:37,263 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:52:37,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:52:37,355 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:52:37,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:52:37,477 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:52:37,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37 WrapperNode [2023-12-02 18:52:37,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:52:37,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:52:37,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:52:37,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:52:37,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,583 INFO L138 Inliner]: procedures = 180, calls = 401, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1340 [2023-12-02 18:52:37,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:52:37,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:52:37,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:52:37,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:52:37,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:52:37,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:52:37,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:52:37,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:52:37,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (1/1) ... [2023-12-02 18:52:37,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:52:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:52:37,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:52:37,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:52:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 18:52:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 18:52:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 18:52:37,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 18:52:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 18:52:37,774 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 18:52:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:52:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:52:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:52:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 18:52:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 18:52:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:52:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 18:52:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 18:52:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:52:37,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:52:37,991 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:52:37,992 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:52:37,996 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 18:52:43,451 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:52:43,650 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:52:43,650 INFO L309 CfgBuilder]: Removed 69 assume(true) statements. [2023-12-02 18:52:43,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:52:43 BoogieIcfgContainer [2023-12-02 18:52:43,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:52:43,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:52:43,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:52:43,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:52:43,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:52:36" (1/3) ... [2023-12-02 18:52:43,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eee53a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:52:43, skipping insertion in model container [2023-12-02 18:52:43,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:37" (2/3) ... [2023-12-02 18:52:43,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eee53a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:52:43, skipping insertion in model container [2023-12-02 18:52:43,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:52:43" (3/3) ... [2023-12-02 18:52:43,660 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-2.i [2023-12-02 18:52:43,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:52:43,680 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 753 error locations. [2023-12-02 18:52:43,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:52:43,752 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;@678b30c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:52:43,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 753 error locations. [2023-12-02 18:52:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:52:43,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:52:43,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:43,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:52:43,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:52:43,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash 70444892, now seen corresponding path program 1 times [2023-12-02 18:52:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:43,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732002301] [2023-12-02 18:52:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:43,785 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-12-02 18:52:43,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:43,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:43,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:43,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 18:52:43,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:43,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:52:43,999 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:44,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732002301] [2023-12-02 18:52:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732002301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:52:44,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:52:44,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:52:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931254993] [2023-12-02 18:52:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:52:44,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 18:52:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:44,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 18:52:44,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 18:52:44,039 INFO L87 Difference]: Start difference. First operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-12-02 18:52:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:44,963 INFO L93 Difference]: Finished difference Result 1321 states and 1404 transitions. [2023-12-02 18:52:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 18:52:44,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-12-02 18:52:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:44,988 INFO L225 Difference]: With dead ends: 1321 [2023-12-02 18:52:44,989 INFO L226 Difference]: Without dead ends: 1320 [2023-12-02 18:52:44,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 18:52:44,995 INFO L413 NwaCegarLoop]: 1261 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:44,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1261 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 18:52:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-12-02 18:52:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2023-12-02 18:52:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 565 states have (on average 2.426548672566372) internal successors, (1371), 1311 states have internal predecessors, (1371), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:52:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1403 transitions. [2023-12-02 18:52:45,083 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1403 transitions. Word has length 4 [2023-12-02 18:52:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:45,083 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1403 transitions. [2023-12-02 18:52:45,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-12-02 18:52:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1403 transitions. [2023-12-02 18:52:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:52:45,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:45,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:52:45,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 18:52:45,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:45,286 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:52:45,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 70444954, now seen corresponding path program 1 times [2023-12-02 18:52:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744366384] [2023-12-02 18:52:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:45,287 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-12-02 18:52:45,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:45,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:45,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:45,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:52:45,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:45,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:52:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:45,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:52:45,489 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744366384] [2023-12-02 18:52:45,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744366384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:52:45,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:52:45,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:52:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026134207] [2023-12-02 18:52:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:52:45,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:52:45,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:52:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:52:45,493 INFO L87 Difference]: Start difference. First operand 1320 states and 1403 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:48,067 INFO L93 Difference]: Finished difference Result 1350 states and 1446 transitions. [2023-12-02 18:52:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:52:48,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:52:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:48,074 INFO L225 Difference]: With dead ends: 1350 [2023-12-02 18:52:48,075 INFO L226 Difference]: Without dead ends: 1350 [2023-12-02 18:52:48,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:52:48,076 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 1042 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:48,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 838 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 18:52:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2023-12-02 18:52:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1293. [2023-12-02 18:52:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 631 states have (on average 2.223454833597464) internal successors, (1403), 1284 states have internal predecessors, (1403), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:52:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1435 transitions. [2023-12-02 18:52:48,115 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1435 transitions. Word has length 4 [2023-12-02 18:52:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:48,115 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1435 transitions. [2023-12-02 18:52:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1435 transitions. [2023-12-02 18:52:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:52:48,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:48,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:52:48,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 18:52:48,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:48,317 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:52:48,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash 70444955, now seen corresponding path program 1 times [2023-12-02 18:52:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822559324] [2023-12-02 18:52:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:48,318 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-12-02 18:52:48,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:48,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:48,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:48,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:52:48,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:48,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:52:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:48,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:52:48,434 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822559324] [2023-12-02 18:52:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822559324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:52:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:52:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:52:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037838153] [2023-12-02 18:52:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:52:48,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:52:48,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:52:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:52:48,437 INFO L87 Difference]: Start difference. First operand 1293 states and 1435 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:52,274 INFO L93 Difference]: Finished difference Result 1565 states and 1727 transitions. [2023-12-02 18:52:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:52:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:52:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:52,281 INFO L225 Difference]: With dead ends: 1565 [2023-12-02 18:52:52,281 INFO L226 Difference]: Without dead ends: 1565 [2023-12-02 18:52:52,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:52:52,282 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 456 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:52,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1462 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 18:52:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2023-12-02 18:52:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1416. [2023-12-02 18:52:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 764 states have (on average 2.193717277486911) internal successors, (1676), 1407 states have internal predecessors, (1676), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:52:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1708 transitions. [2023-12-02 18:52:52,312 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1708 transitions. Word has length 4 [2023-12-02 18:52:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:52,312 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1708 transitions. [2023-12-02 18:52:52,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1708 transitions. [2023-12-02 18:52:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 18:52:52,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:52,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 18:52:52,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 18:52:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:52,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:52:52,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2109482456, now seen corresponding path program 1 times [2023-12-02 18:52:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:52,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038244835] [2023-12-02 18:52:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:52,515 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-12-02 18:52:52,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:52,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:52,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:52,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:52:52,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:52,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:52:52,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038244835] [2023-12-02 18:52:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038244835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:52:52,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:52:52,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:52:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911084007] [2023-12-02 18:52:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:52:52,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:52:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:52:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:52:52,632 INFO L87 Difference]: Start difference. First operand 1416 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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-12-02 18:52:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:54,222 INFO L93 Difference]: Finished difference Result 2605 states and 3158 transitions. [2023-12-02 18:52:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:52:54,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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-12-02 18:52:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:54,234 INFO L225 Difference]: With dead ends: 2605 [2023-12-02 18:52:54,235 INFO L226 Difference]: Without dead ends: 2605 [2023-12-02 18:52:54,235 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-12-02 18:52:54,236 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 1029 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:54,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2710 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 18:52:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2023-12-02 18:52:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1417. [2023-12-02 18:52:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 765 states have (on average 2.1921568627450982) internal successors, (1677), 1408 states have internal predecessors, (1677), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:52:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1709 transitions. [2023-12-02 18:52:54,285 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1709 transitions. Word has length 5 [2023-12-02 18:52:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:54,286 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1709 transitions. [2023-12-02 18:52:54,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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-12-02 18:52:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1709 transitions. [2023-12-02 18:52:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 18:52:54,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:54,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:52:54,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 18:52:54,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:54,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:52:54,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash 658452484, now seen corresponding path program 1 times [2023-12-02 18:52:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397641332] [2023-12-02 18:52:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:54,489 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-12-02 18:52:54,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:54,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:54,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:54,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:52:54,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:54,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:52:54,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397641332] [2023-12-02 18:52:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397641332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:52:54,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:52:54,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:52:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661021066] [2023-12-02 18:52:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:52:54,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:52:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:54,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:52:54,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:52:54,632 INFO L87 Difference]: Start difference. First operand 1417 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-12-02 18:52:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:55,650 INFO L93 Difference]: Finished difference Result 1378 states and 1669 transitions. [2023-12-02 18:52:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:52:55,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-12-02 18:52:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:55,657 INFO L225 Difference]: With dead ends: 1378 [2023-12-02 18:52:55,657 INFO L226 Difference]: Without dead ends: 1378 [2023-12-02 18:52:55,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-02 18:52:55,658 INFO L413 NwaCegarLoop]: 1109 mSDtfsCounter, 70 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:55,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2169 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 18:52:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-12-02 18:52:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2023-12-02 18:52:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 750 states have (on average 2.1826666666666665) internal successors, (1637), 1369 states have internal predecessors, (1637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:52:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1669 transitions. [2023-12-02 18:52:55,685 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1669 transitions. Word has length 10 [2023-12-02 18:52:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:55,685 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1669 transitions. [2023-12-02 18:52:55,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-12-02 18:52:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1669 transitions. [2023-12-02 18:52:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 18:52:55,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:55,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:52:55,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:55,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:55,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:52:55,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1412640446, now seen corresponding path program 1 times [2023-12-02 18:52:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222094945] [2023-12-02 18:52:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:55,890 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-12-02 18:52:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:55,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:55,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:56,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:52:56,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:56,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:52:56,064 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222094945] [2023-12-02 18:52:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222094945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:52:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:52:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:52:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980689058] [2023-12-02 18:52:56,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:52:56,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:52:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:56,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:52:56,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:52:56,066 INFO L87 Difference]: Start difference. First operand 1378 states and 1669 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-02 18:52:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:57,443 INFO L93 Difference]: Finished difference Result 1364 states and 1648 transitions. [2023-12-02 18:52:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:52:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-12-02 18:52:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:57,450 INFO L225 Difference]: With dead ends: 1364 [2023-12-02 18:52:57,450 INFO L226 Difference]: Without dead ends: 1364 [2023-12-02 18:52:57,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-12-02 18:52:57,451 INFO L413 NwaCegarLoop]: 1078 mSDtfsCounter, 58 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:57,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3210 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 18:52:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-12-02 18:52:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1363. [2023-12-02 18:52:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 749 states have (on average 2.156208277703605) internal successors, (1615), 1354 states have internal predecessors, (1615), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:52:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1647 transitions. [2023-12-02 18:52:57,473 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1647 transitions. Word has length 12 [2023-12-02 18:52:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:57,473 INFO L495 AbstractCegarLoop]: Abstraction has 1363 states and 1647 transitions. [2023-12-02 18:52:57,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-02 18:52:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1647 transitions. [2023-12-02 18:52:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:52:57,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:57,474 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-12-02 18:52:57,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:57,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:52:57,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash 143090636, now seen corresponding path program 1 times [2023-12-02 18:52:57,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:57,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838023225] [2023-12-02 18:52:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:57,679 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-12-02 18:52:57,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:57,679 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:57,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:52:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:57,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:52:57,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:57,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:52:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:57,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:52:57,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:57,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838023225] [2023-12-02 18:52:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838023225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:52:57,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:52:57,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:52:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167745978] [2023-12-02 18:52:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:52:57,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:52:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:52:57,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:52:57,921 INFO L87 Difference]: Start difference. First operand 1363 states and 1647 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12-02 18:53:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:00,985 INFO L93 Difference]: Finished difference Result 1416 states and 1654 transitions. [2023-12-02 18:53:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:53:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12-02 18:53:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:00,992 INFO L225 Difference]: With dead ends: 1416 [2023-12-02 18:53:00,992 INFO L226 Difference]: Without dead ends: 1416 [2023-12-02 18:53:00,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-12-02 18:53:00,993 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 977 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:00,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1267 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 18:53:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2023-12-02 18:53:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1359. [2023-12-02 18:53:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 749 states have (on average 2.15086782376502) internal successors, (1611), 1350 states have internal predecessors, (1611), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:53:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1643 transitions. [2023-12-02 18:53:01,014 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1643 transitions. Word has length 26 [2023-12-02 18:53:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:01,015 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 1643 transitions. [2023-12-02 18:53:01,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12-02 18:53:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1643 transitions. [2023-12-02 18:53:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:53:01,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:01,016 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-12-02 18:53:01,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:01,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:01,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:01,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash 143090637, now seen corresponding path program 1 times [2023-12-02 18:53:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:01,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608295860] [2023-12-02 18:53:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:01,217 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-12-02 18:53:01,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:01,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:01,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:01,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:53:01,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:01,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:53:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:01,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:53:01,508 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608295860] [2023-12-02 18:53:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608295860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:53:01,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:53:01,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:53:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854985360] [2023-12-02 18:53:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:53:01,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:53:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:01,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:53:01,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:53:01,510 INFO L87 Difference]: Start difference. First operand 1359 states and 1643 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12-02 18:53:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:05,976 INFO L93 Difference]: Finished difference Result 1504 states and 1658 transitions. [2023-12-02 18:53:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:53:05,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12-02 18:53:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:05,981 INFO L225 Difference]: With dead ends: 1504 [2023-12-02 18:53:05,981 INFO L226 Difference]: Without dead ends: 1504 [2023-12-02 18:53:05,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-12-02 18:53:05,982 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 393 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:05,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1938 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-02 18:53:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2023-12-02 18:53:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1355. [2023-12-02 18:53:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 749 states have (on average 2.145527369826435) internal successors, (1607), 1346 states have internal predecessors, (1607), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:53:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1639 transitions. [2023-12-02 18:53:06,011 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1639 transitions. Word has length 26 [2023-12-02 18:53:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:06,012 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 1639 transitions. [2023-12-02 18:53:06,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12-02 18:53:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1639 transitions. [2023-12-02 18:53:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 18:53:06,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:06,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:53:06,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 18:53:06,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:06,214 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:06,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash 528621638, now seen corresponding path program 1 times [2023-12-02 18:53:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:06,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807414079] [2023-12-02 18:53:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:06,215 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-12-02 18:53:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:06,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:06,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:06,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:53:06,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:06,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:53:06,488 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807414079] [2023-12-02 18:53:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807414079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:53:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:53:06,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:53:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194161219] [2023-12-02 18:53:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:53:06,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:53:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:53:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:53:06,490 INFO L87 Difference]: Start difference. First operand 1355 states and 1639 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-12-02 18:53:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:07,851 INFO L93 Difference]: Finished difference Result 1349 states and 1629 transitions. [2023-12-02 18:53:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:53:07,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2023-12-02 18:53:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:07,857 INFO L225 Difference]: With dead ends: 1349 [2023-12-02 18:53:07,857 INFO L226 Difference]: Without dead ends: 1349 [2023-12-02 18:53:07,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-12-02 18:53:07,858 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 23 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:07,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3196 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 18:53:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-12-02 18:53:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2023-12-02 18:53:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 743 states have (on average 2.149394347240915) internal successors, (1597), 1340 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:53:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1629 transitions. [2023-12-02 18:53:07,875 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1629 transitions. Word has length 42 [2023-12-02 18:53:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:07,875 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1629 transitions. [2023-12-02 18:53:07,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-12-02 18:53:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1629 transitions. [2023-12-02 18:53:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 18:53:07,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:07,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:53:07,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:08,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:08,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:08,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash -341001050, now seen corresponding path program 1 times [2023-12-02 18:53:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325562881] [2023-12-02 18:53:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:08,079 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-12-02 18:53:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:08,080 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:08,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:08,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:53:08,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:08,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:53:08,560 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325562881] [2023-12-02 18:53:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325562881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:53:08,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:53:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:53:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861468962] [2023-12-02 18:53:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:53:08,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:53:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:53:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:53:08,562 INFO L87 Difference]: Start difference. First operand 1349 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-12-02 18:53:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:09,816 INFO L93 Difference]: Finished difference Result 1572 states and 1861 transitions. [2023-12-02 18:53:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:53:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2023-12-02 18:53:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:09,824 INFO L225 Difference]: With dead ends: 1572 [2023-12-02 18:53:09,824 INFO L226 Difference]: Without dead ends: 1572 [2023-12-02 18:53:09,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-12-02 18:53:09,825 INFO L413 NwaCegarLoop]: 1139 mSDtfsCounter, 246 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:09,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2112 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 18:53:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-12-02 18:53:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1392. [2023-12-02 18:53:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 786 states have (on average 2.0865139949109417) internal successors, (1640), 1383 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:53:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1672 transitions. [2023-12-02 18:53:09,845 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1672 transitions. Word has length 46 [2023-12-02 18:53:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:09,845 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1672 transitions. [2023-12-02 18:53:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-12-02 18:53:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1672 transitions. [2023-12-02 18:53:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 18:53:09,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:09,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:53:09,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:10,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:10,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:10,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1272107280, now seen corresponding path program 1 times [2023-12-02 18:53:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:10,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462818769] [2023-12-02 18:53:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:10,053 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-12-02 18:53:10,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:10,054 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:10,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:10,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:53:10,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:10,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:53:10,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:53:10,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:10,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 18:53:10,818 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:53:10,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:53:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:10,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:53:10,844 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:10,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462818769] [2023-12-02 18:53:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462818769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:53:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:53:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:53:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111496078] [2023-12-02 18:53:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:53:10,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:53:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:10,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:53:10,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:53:10,846 INFO L87 Difference]: Start difference. First operand 1392 states and 1672 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-12-02 18:53:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:14,154 INFO L93 Difference]: Finished difference Result 1364 states and 1598 transitions. [2023-12-02 18:53:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:53:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2023-12-02 18:53:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:14,160 INFO L225 Difference]: With dead ends: 1364 [2023-12-02 18:53:14,160 INFO L226 Difference]: Without dead ends: 1364 [2023-12-02 18:53:14,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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-12-02 18:53:14,160 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 943 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:14,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 702 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-02 18:53:14,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-12-02 18:53:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1175. [2023-12-02 18:53:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:53:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1304 transitions. [2023-12-02 18:53:14,175 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1304 transitions. Word has length 49 [2023-12-02 18:53:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:14,175 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1304 transitions. [2023-12-02 18:53:14,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-12-02 18:53:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1304 transitions. [2023-12-02 18:53:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 18:53:14,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:14,176 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, 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, 1] [2023-12-02 18:53:14,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 18:53:14,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:14,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:14,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash -570099047, now seen corresponding path program 1 times [2023-12-02 18:53:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222059589] [2023-12-02 18:53:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:14,378 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-12-02 18:53:14,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:14,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:14,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:14,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:53:14,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:14,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:53:14,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:53:14,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 18:53:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:14,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:53:14,643 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222059589] [2023-12-02 18:53:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222059589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:53:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:53:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:53:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496787760] [2023-12-02 18:53:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:53:14,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:53:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:53:14,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:53:14,645 INFO L87 Difference]: Start difference. First operand 1175 states and 1304 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-12-02 18:53:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:18,285 INFO L93 Difference]: Finished difference Result 1174 states and 1303 transitions. [2023-12-02 18:53:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:53:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2023-12-02 18:53:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:18,290 INFO L225 Difference]: With dead ends: 1174 [2023-12-02 18:53:18,291 INFO L226 Difference]: Without dead ends: 1174 [2023-12-02 18:53:18,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:53:18,291 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 3 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:18,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2556 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 18:53:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-12-02 18:53:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2023-12-02 18:53:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 653 states have (on average 1.9464012251148546) internal successors, (1271), 1165 states have internal predecessors, (1271), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:53:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1303 transitions. [2023-12-02 18:53:18,305 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1303 transitions. Word has length 53 [2023-12-02 18:53:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:18,306 INFO L495 AbstractCegarLoop]: Abstraction has 1174 states and 1303 transitions. [2023-12-02 18:53:18,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-12-02 18:53:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1303 transitions. [2023-12-02 18:53:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 18:53:18,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:18,307 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, 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, 1] [2023-12-02 18:53:18,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 18:53:18,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:18,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:18,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash -570099046, now seen corresponding path program 1 times [2023-12-02 18:53:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:18,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924684050] [2023-12-02 18:53:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:18,509 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-12-02 18:53:18,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:18,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:18,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:18,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 18:53:18,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:18,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:53:18,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 18:53:18,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:53:18,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 18:53:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:18,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:53:18,821 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924684050] [2023-12-02 18:53:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924684050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:53:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:53:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:53:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315557625] [2023-12-02 18:53:18,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:53:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:53:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:53:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:53:18,822 INFO L87 Difference]: Start difference. First operand 1174 states and 1303 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-12-02 18:53:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:23,635 INFO L93 Difference]: Finished difference Result 1173 states and 1302 transitions. [2023-12-02 18:53:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:53:23,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2023-12-02 18:53:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:23,640 INFO L225 Difference]: With dead ends: 1173 [2023-12-02 18:53:23,640 INFO L226 Difference]: Without dead ends: 1173 [2023-12-02 18:53:23,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:53:23,640 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 1 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:23,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2593 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 18:53:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-12-02 18:53:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2023-12-02 18:53:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 652 states have (on average 1.9478527607361964) internal successors, (1270), 1164 states have internal predecessors, (1270), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:53:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1302 transitions. [2023-12-02 18:53:23,653 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1302 transitions. Word has length 53 [2023-12-02 18:53:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:23,653 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1302 transitions. [2023-12-02 18:53:23,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-12-02 18:53:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1302 transitions. [2023-12-02 18:53:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:53:23,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:23,654 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:53:23,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 18:53:23,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:23,855 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:23,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2128582719, now seen corresponding path program 1 times [2023-12-02 18:53:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:23,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724141241] [2023-12-02 18:53:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:23,856 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-12-02 18:53:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:23,857 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:23,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:24,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:53:24,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:24,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:53:24,108 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:24,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724141241] [2023-12-02 18:53:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724141241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:53:24,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:53:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:53:24,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103555152] [2023-12-02 18:53:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:53:24,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:53:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:53:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:53:24,110 INFO L87 Difference]: Start difference. First operand 1173 states and 1302 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 18:53:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:25,365 INFO L93 Difference]: Finished difference Result 1175 states and 1306 transitions. [2023-12-02 18:53:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:53:25,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-12-02 18:53:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:25,371 INFO L225 Difference]: With dead ends: 1175 [2023-12-02 18:53:25,371 INFO L226 Difference]: Without dead ends: 1175 [2023-12-02 18:53:25,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-12-02 18:53:25,372 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:25,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2991 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 18:53:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2023-12-02 18:53:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2023-12-02 18:53:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:53:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1306 transitions. [2023-12-02 18:53:25,387 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1306 transitions. Word has length 59 [2023-12-02 18:53:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:25,388 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1306 transitions. [2023-12-02 18:53:25,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 18:53:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1306 transitions. [2023-12-02 18:53:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 18:53:25,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:25,389 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:53:25,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 18:53:25,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:25,589 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:25,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1894039622, now seen corresponding path program 1 times [2023-12-02 18:53:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:25,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597738493] [2023-12-02 18:53:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:25,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-12-02 18:53:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:25,591 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:25,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 18:53:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:25,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:53:25,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:25,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:25,894 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597738493] [2023-12-02 18:53:25,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597738493] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:53:25,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1685581685] [2023-12-02 18:53:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:25,895 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:53:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:53:25,896 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:53:25,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 18:53:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:26,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:53:26,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:26,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:26,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1685581685] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:53:26,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124438573] [2023-12-02 18:53:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:26,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:53:26,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:53:26,378 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:53:26,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 18:53:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:26,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:53:26,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:26,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124438573] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:53:26,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:53:26,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 18:53:26,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793185047] [2023-12-02 18:53:26,672 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:53:26,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 18:53:26,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:26,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 18:53:26,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:53:26,673 INFO L87 Difference]: Start difference. First operand 1175 states and 1306 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 18:53:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:53:28,124 INFO L93 Difference]: Finished difference Result 1184 states and 1321 transitions. [2023-12-02 18:53:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:53:28,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2023-12-02 18:53:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:53:28,130 INFO L225 Difference]: With dead ends: 1184 [2023-12-02 18:53:28,130 INFO L226 Difference]: Without dead ends: 1184 [2023-12-02 18:53:28,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:53:28,131 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 7 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:53:28,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2987 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 18:53:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2023-12-02 18:53:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1183. [2023-12-02 18:53:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 660 states have (on average 1.946969696969697) internal successors, (1285), 1173 states have internal predecessors, (1285), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:53:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1319 transitions. [2023-12-02 18:53:28,151 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1319 transitions. Word has length 60 [2023-12-02 18:53:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:53:28,152 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1319 transitions. [2023-12-02 18:53:28,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 18:53:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1319 transitions. [2023-12-02 18:53:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 18:53:28,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:53:28,153 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:53:28,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 18:53:28,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 18:53:28,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 18:53:28,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:53:28,754 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:53:28,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:53:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2075451649, now seen corresponding path program 2 times [2023-12-02 18:53:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:53:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177394625] [2023-12-02 18:53:28,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:53:28,755 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-12-02 18:53:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:53:28,756 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:53:28,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 18:53:29,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:53:29,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:53:29,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:53:29,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:29,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:29,373 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:53:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177394625] [2023-12-02 18:53:29,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177394625] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:53:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1477955711] [2023-12-02 18:53:29,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:53:29,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:53:29,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:53:29,374 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:53:29,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 18:53:30,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:53:30,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:53:30,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:53:30,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:30,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:30,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1477955711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:53:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526517957] [2023-12-02 18:53:30,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:53:30,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:53:30,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:53:30,486 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:53:30,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 18:53:45,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:53:45,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:53:45,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 18:53:45,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:45,206 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:53:45,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:53:45,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:53:45,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:53:45,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:53:45,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:53:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 18:53:45,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:45,743 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 18:53:45,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-12-02 18:53:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526517957] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:53:45,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 18:53:45,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 18:53:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952610986] [2023-12-02 18:53:45,850 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 18:53:45,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 18:53:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 18:53:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=550, Unknown=9, NotChecked=0, Total=650 [2023-12-02 18:53:45,852 INFO L87 Difference]: Start difference. First operand 1183 states and 1319 transitions. Second operand has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 18:54:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:54:01,987 INFO L93 Difference]: Finished difference Result 1253 states and 1355 transitions. [2023-12-02 18:54:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 18:54:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2023-12-02 18:54:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:54:01,992 INFO L225 Difference]: With dead ends: 1253 [2023-12-02 18:54:01,992 INFO L226 Difference]: Without dead ends: 1251 [2023-12-02 18:54:01,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=2500, Unknown=12, NotChecked=0, Total=2970 [2023-12-02 18:54:01,993 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 881 mSDsluCounter, 8348 mSDsCounter, 0 mSdLazyCounter, 9899 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 8948 SdHoareTripleChecker+Invalid, 9946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 9899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:54:01,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 8948 Invalid, 9946 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 9899 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2023-12-02 18:54:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-12-02 18:54:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1191. [2023-12-02 18:54:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 669 states have (on average 1.937219730941704) internal successors, (1296), 1181 states have internal predecessors, (1296), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:54:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1330 transitions. [2023-12-02 18:54:02,010 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1330 transitions. Word has length 63 [2023-12-02 18:54:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:54:02,010 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1330 transitions. [2023-12-02 18:54:02,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 18:54:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1330 transitions. [2023-12-02 18:54:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 18:54:02,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:54:02,011 INFO L195 NwaCegarLoop]: trace histogram [10, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:54:02,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 18:54:02,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 18:54:02,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 18:54:02,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 18:54:02,612 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:54:02,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:54:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash 399824160, now seen corresponding path program 1 times [2023-12-02 18:54:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:54:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896230103] [2023-12-02 18:54:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:02,613 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-12-02 18:54:02,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:54:02,614 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:54:02,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:54:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:02,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 18:54:02,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:03,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:03,517 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:54:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896230103] [2023-12-02 18:54:03,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896230103] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:54:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1085352468] [2023-12-02 18:54:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:03,518 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:54:03,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:54:03,519 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:54:03,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 18:54:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:04,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 18:54:04,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:04,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1085352468] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:54:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425523538] [2023-12-02 18:54:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:54:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:54:04,210 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:54:04,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 18:54:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:04,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 18:54:04,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:04,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:05,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425523538] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:54:05,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:54:05,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 18:54:05,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320732389] [2023-12-02 18:54:05,289 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:54:05,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 18:54:05,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:54:05,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 18:54:05,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 18:54:05,291 INFO L87 Difference]: Start difference. First operand 1191 states and 1330 transitions. Second operand has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 18:54:13,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:54:13,228 INFO L93 Difference]: Finished difference Result 1221 states and 1384 transitions. [2023-12-02 18:54:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 18:54:13,228 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2023-12-02 18:54:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:54:13,234 INFO L225 Difference]: With dead ends: 1221 [2023-12-02 18:54:13,234 INFO L226 Difference]: Without dead ends: 1218 [2023-12-02 18:54:13,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 18:54:13,236 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 27 mSDsluCounter, 13876 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 14870 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:54:13,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 14870 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2863 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-02 18:54:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2023-12-02 18:54:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1209. [2023-12-02 18:54:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 687 states have (on average 1.9199417758369723) internal successors, (1319), 1199 states have internal predecessors, (1319), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:54:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1353 transitions. [2023-12-02 18:54:13,253 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1353 transitions. Word has length 69 [2023-12-02 18:54:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:54:13,254 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1353 transitions. [2023-12-02 18:54:13,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 18:54:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1353 transitions. [2023-12-02 18:54:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-02 18:54:13,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:54:13,255 INFO L195 NwaCegarLoop]: trace histogram [22, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:54:13,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 18:54:13,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 18:54:13,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 18:54:13,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:54:13,856 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:54:13,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:54:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -259065504, now seen corresponding path program 2 times [2023-12-02 18:54:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:54:13,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736975195] [2023-12-02 18:54:13,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:54:13,857 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-12-02 18:54:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:54:13,858 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:54:13,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:54:14,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:54:14,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:54:14,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 18:54:14,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:14,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:16,841 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:54:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736975195] [2023-12-02 18:54:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736975195] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:54:16,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1485449081] [2023-12-02 18:54:16,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:54:16,842 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:54:16,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:54:16,843 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:54:16,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 18:54:18,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:54:18,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:54:18,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 18:54:18,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:18,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1485449081] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:54:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948665443] [2023-12-02 18:54:18,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:54:18,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:54:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:54:18,693 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:54:18,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 18:54:32,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:54:32,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:54:32,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 18:54:32,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:32,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:54:32,938 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:54:32,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:54:33,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 18:54:33,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:54:33,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 18:54:33,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:54:33,983 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:54:33,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:54:33,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:54:34,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 18:54:34,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:54:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-02 18:54:34,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:35,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:54:35,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948665443] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:54:35,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 18:54:35,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 18:54:35,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839689914] [2023-12-02 18:54:35,200 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 18:54:35,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 18:54:35,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:54:35,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 18:54:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 18:54:35,202 INFO L87 Difference]: Start difference. First operand 1209 states and 1353 transitions. Second operand has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 18:55:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:55:32,037 INFO L93 Difference]: Finished difference Result 1378 states and 1574 transitions. [2023-12-02 18:55:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-12-02 18:55:32,038 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 81 [2023-12-02 18:55:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:55:32,045 INFO L225 Difference]: With dead ends: 1378 [2023-12-02 18:55:32,045 INFO L226 Difference]: Without dead ends: 1369 [2023-12-02 18:55:32,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7045 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=5889, Invalid=20846, Unknown=1, NotChecked=324, Total=27060 [2023-12-02 18:55:32,054 INFO L413 NwaCegarLoop]: 606 mSDtfsCounter, 919 mSDsluCounter, 16114 mSDsCounter, 0 mSdLazyCounter, 21625 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 16720 SdHoareTripleChecker+Invalid, 21750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 21625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:55:32,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 16720 Invalid, 21750 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [125 Valid, 21625 Invalid, 0 Unknown, 0 Unchecked, 39.0s Time] [2023-12-02 18:55:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2023-12-02 18:55:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1293. [2023-12-02 18:55:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 771 states have (on average 1.8365758754863812) internal successors, (1416), 1282 states have internal predecessors, (1416), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:55:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1450 transitions. [2023-12-02 18:55:32,081 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1450 transitions. Word has length 81 [2023-12-02 18:55:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:55:32,082 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1450 transitions. [2023-12-02 18:55:32,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 18:55:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1450 transitions. [2023-12-02 18:55:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 18:55:32,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:55:32,083 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:55:32,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 18:55:32,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 18:55:32,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 18:55:32,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:55:32,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:55:32,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:55:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash -256213520, now seen corresponding path program 1 times [2023-12-02 18:55:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:55:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518512810] [2023-12-02 18:55:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:55:32,685 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-12-02 18:55:32,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:55:32,686 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:55:32,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (28)] Waiting until timeout for monitored process [2023-12-02 18:55:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:55:33,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 18:55:33,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:55:33,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:55:33,543 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:55:33,543 INFO L378 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-12-02 18:55:33,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:55:33,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 18:55:34,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:34,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:55:34,629 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:34,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:55:34,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:55:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:55:34,679 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:55:36,800 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 18:55:37,159 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2913))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2867)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:55:37,161 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:55:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518512810] [2023-12-02 18:55:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518512810] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:55:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [663187734] [2023-12-02 18:55:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:55:37,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:55:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:55:37,163 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:55:37,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 18:55:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:55:39,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 18:55:39,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:55:39,228 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 18:55:39,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 18:55:39,688 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 18:55:39,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 18:55:39,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-02 18:55:40,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 18:55:41,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:55:41,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 18:55:41,547 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:55:41,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 18:55:41,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 18:55:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:55:41,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:55:44,068 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3366))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2867)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:55:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [663187734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:55:44,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401223683] [2023-12-02 18:55:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:55:44,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:55:44,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:55:44,072 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:55:44,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 18:55:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:55:44,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 18:55:44,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:55:44,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:55:44,693 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:55:44,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:55:44,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:55:45,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:45,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:55:45,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:45,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:55:45,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:55:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:55:45,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:55:48,067 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 18:55:48,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-12-02 18:55:48,078 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3818))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2867)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 18:55:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401223683] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:55:48,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:55:48,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2023-12-02 18:55:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5805034] [2023-12-02 18:55:48,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:55:48,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 18:55:48,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:55:48,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 18:55:48,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=738, Unknown=7, NotChecked=236, Total=1122 [2023-12-02 18:55:48,082 INFO L87 Difference]: Start difference. First operand 1293 states and 1450 transitions. Second operand has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 27 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:56:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:56:09,446 INFO L93 Difference]: Finished difference Result 2416 states and 2624 transitions. [2023-12-02 18:56:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 18:56:09,446 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 27 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 105 [2023-12-02 18:56:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:56:09,453 INFO L225 Difference]: With dead ends: 2416 [2023-12-02 18:56:09,453 INFO L226 Difference]: Without dead ends: 2416 [2023-12-02 18:56:09,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=227, Invalid=1342, Unknown=7, NotChecked=316, Total=1892 [2023-12-02 18:56:09,454 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 2469 mSDsluCounter, 6966 mSDsCounter, 0 mSdLazyCounter, 9873 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2492 SdHoareTripleChecker+Valid, 7479 SdHoareTripleChecker+Invalid, 9977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 9873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:56:09,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2492 Valid, 7479 Invalid, 9977 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 9873 Invalid, 0 Unknown, 0 Unchecked, 20.8s Time] [2023-12-02 18:56:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2023-12-02 18:56:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1292. [2023-12-02 18:56:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 771 states have (on average 1.835278858625162) internal successors, (1415), 1281 states have internal predecessors, (1415), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:56:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1449 transitions. [2023-12-02 18:56:09,479 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1449 transitions. Word has length 105 [2023-12-02 18:56:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:56:09,480 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 1449 transitions. [2023-12-02 18:56:09,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.666666666666667) internal successors, (136), 27 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:56:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1449 transitions. [2023-12-02 18:56:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 18:56:09,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:56:09,481 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:56:09,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (28)] Ended with exit code 0 [2023-12-02 18:56:09,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 18:56:09,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 18:56:10,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:56:10,082 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:56:10,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:56:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -256213519, now seen corresponding path program 1 times [2023-12-02 18:56:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:56:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712306502] [2023-12-02 18:56:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:56:10,083 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-12-02 18:56:10,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:56:10,084 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:56:10,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (31)] Waiting until timeout for monitored process [2023-12-02 18:56:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:56:10,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 18:56:10,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:56:10,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:56:11,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:56:11,029 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:56:11,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:56:11,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:56:11,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 18:56:11,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 18:56:11,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:56:11,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:56:11,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:56:11,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:56:11,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:56:11,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:56:11,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:56:12,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 18:56:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:56:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:56:12,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:56:12,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:56:12,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 18:56:13,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4362))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4363) .cse0 v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4363) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4362) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-12-02 18:56:13,527 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:56:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712306502] [2023-12-02 18:56:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712306502] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:56:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1382200374] [2023-12-02 18:56:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:56:13,528 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:56:13,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:56:13,534 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:56:13,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 18:58:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:58:08,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 18:58:08,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:58:08,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:58:08,833 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:58:08,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:58:08,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:58:08,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:58:08,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:58:09,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 18:58:09,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:58:09,721 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:58:09,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:58:09,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:58:09,883 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:58:09,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:58:09,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:58:09,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 18:58:09,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:58:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:58:09,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:58:09,965 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 18:58:09,998 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 18:58:11,432 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4908) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4907))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4908) .cse2 v_ArrVal_4816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:58:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1382200374] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:58:11,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694794800] [2023-12-02 18:58:11,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:58:11,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:58:11,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:58:11,442 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:58:11,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 18:58:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:58:11,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 18:58:12,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:58:12,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:58:12,111 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:58:12,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:58:12,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:58:12,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 18:58:12,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:58:12,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 18:58:12,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:58:12,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:58:12,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:58:12,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:58:12,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:58:12,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:58:12,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:58:12,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 18:58:12,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:58:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:58:12,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:58:13,043 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:58:13,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:58:14,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694794800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:58:14,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:58:14,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 18:58:14,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816259495] [2023-12-02 18:58:14,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:58:14,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 18:58:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:58:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 18:58:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=251, Unknown=17, NotChecked=312, Total=650 [2023-12-02 18:58:14,957 INFO L87 Difference]: Start difference. First operand 1292 states and 1449 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 18:58:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:58:32,127 INFO L93 Difference]: Finished difference Result 1645 states and 1771 transitions. [2023-12-02 18:58:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:58:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-12-02 18:58:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:58:32,134 INFO L225 Difference]: With dead ends: 1645 [2023-12-02 18:58:32,134 INFO L226 Difference]: Without dead ends: 1645 [2023-12-02 18:58:32,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 301 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=114, Invalid=406, Unknown=18, NotChecked=392, Total=930 [2023-12-02 18:58:32,135 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1122 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 6935 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 6954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:58:32,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 3305 Invalid, 6954 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 6935 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2023-12-02 18:58:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2023-12-02 18:58:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1291. [2023-12-02 18:58:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 771 states have (on average 1.8339818417639429) internal successors, (1414), 1280 states have internal predecessors, (1414), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:58:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1448 transitions. [2023-12-02 18:58:32,163 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1448 transitions. Word has length 105 [2023-12-02 18:58:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:58:32,163 INFO L495 AbstractCegarLoop]: Abstraction has 1291 states and 1448 transitions. [2023-12-02 18:58:32,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 18:58:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1448 transitions. [2023-12-02 18:58:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 18:58:32,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:58:32,165 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:58:32,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 18:58:32,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 18:58:32,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (31)] Forceful destruction successful, exit code 0 [2023-12-02 18:58:32,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:58:32,766 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:58:32,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:58:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1406071941, now seen corresponding path program 1 times [2023-12-02 18:58:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:58:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763228888] [2023-12-02 18:58:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:58:32,767 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-12-02 18:58:32,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:58:32,768 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:58:32,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (34)] Waiting until timeout for monitored process [2023-12-02 18:58:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:58:33,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 18:58:33,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:58:33,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:58:33,881 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:58:33,881 INFO L378 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-12-02 18:58:33,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:58:33,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 18:58:34,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:58:34,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:58:35,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:58:35,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:58:35,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:58:35,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:58:35,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:58:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:58:35,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:58:37,343 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:58:37,358 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:58:37,372 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:58:37,768 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5922))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5875)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:58:37,772 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:58:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763228888] [2023-12-02 18:58:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763228888] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:58:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2099095989] [2023-12-02 18:58:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:58:37,773 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:58:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:58:37,774 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:58:37,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 18:59:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:59:03,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 18:59:03,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:59:03,641 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 18:59:03,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 18:59:04,185 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 18:59:04,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 18:59:04,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-02 18:59:04,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 18:59:05,940 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:59:05,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 18:59:06,136 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:59:06,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 18:59:06,272 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:59:06,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 18:59:06,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 18:59:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:59:06,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:59:06,389 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6345) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 18:59:08,495 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 18:59:08,510 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:59:08,917 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6344 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6391))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6344)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6345)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:59:08,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2099095989] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:59:08,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462027206] [2023-12-02 18:59:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:59:08,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:59:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:59:08,922 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:59:08,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 18:59:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:59:09,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 18:59:09,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:59:09,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:59:09,701 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:59:09,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:59:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:59:10,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:59:10,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 18:59:10,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:59:10,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 18:59:10,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:59:10,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:59:12,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:59:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:59:12,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:59:12,491 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 18:59:12,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-12-02 18:59:12,499 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2023-12-02 18:59:12,509 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 18:59:12,521 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6812)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 18:59:12,533 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6812))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 18:59:12,952 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6859))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6812)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 18:59:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462027206] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:59:12,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:59:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-12-02 18:59:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759266485] [2023-12-02 18:59:12,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:59:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 18:59:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:59:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 18:59:12,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=896, Unknown=21, NotChecked=962, Total=2070 [2023-12-02 18:59:12,958 INFO L87 Difference]: Start difference. First operand 1291 states and 1448 transitions. Second operand has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 30 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:59:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:59:35,261 INFO L93 Difference]: Finished difference Result 2412 states and 2620 transitions. [2023-12-02 18:59:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 18:59:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 30 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 107 [2023-12-02 18:59:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:59:35,269 INFO L225 Difference]: With dead ends: 2412 [2023-12-02 18:59:35,269 INFO L226 Difference]: Without dead ends: 2412 [2023-12-02 18:59:35,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=240, Invalid=1197, Unknown=21, NotChecked=1092, Total=2550 [2023-12-02 18:59:35,271 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 1773 mSDsluCounter, 7098 mSDsCounter, 0 mSdLazyCounter, 10066 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 7610 SdHoareTripleChecker+Invalid, 10185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 10066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:59:35,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 7610 Invalid, 10185 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 10066 Invalid, 0 Unknown, 0 Unchecked, 21.8s Time] [2023-12-02 18:59:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2023-12-02 18:59:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1290. [2023-12-02 18:59:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 771 states have (on average 1.8326848249027237) internal successors, (1413), 1279 states have internal predecessors, (1413), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 18:59:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1447 transitions. [2023-12-02 18:59:35,295 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1447 transitions. Word has length 107 [2023-12-02 18:59:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:59:35,295 INFO L495 AbstractCegarLoop]: Abstraction has 1290 states and 1447 transitions. [2023-12-02 18:59:35,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 30 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:59:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1447 transitions. [2023-12-02 18:59:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 18:59:35,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:59:35,297 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:59:35,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 18:59:35,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (34)] Ended with exit code 0 [2023-12-02 18:59:35,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 18:59:35,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:59:35,898 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 18:59:35,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:59:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1406071940, now seen corresponding path program 1 times [2023-12-02 18:59:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:59:35,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603346161] [2023-12-02 18:59:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:59:35,899 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-12-02 18:59:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:59:35,900 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 18:59:35,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (37)] Waiting until timeout for monitored process [2023-12-02 18:59:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:59:37,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 18:59:37,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:59:37,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:59:37,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:59:37,160 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:59:37,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:59:37,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:59:37,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 18:59:37,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 18:59:37,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:59:38,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:59:38,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:59:38,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:59:38,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:59:38,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:59:38,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:59:38,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:59:38,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:59:38,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:59:38,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 18:59:38,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 18:59:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:59:38,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:59:38,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:59:38,644 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 18:59:38,700 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7327))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7326) .cse0 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7326) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 18:59:38,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7326) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7327))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7326) .cse3 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 18:59:40,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7420))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7327))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7421) .cse0 v_ArrVal_7326) .cse1 v_ArrVal_7329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7420))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7421) .cse6 v_ArrVal_7326) (select (select (store .cse7 .cse6 v_ArrVal_7327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7329))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 18:59:40,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:59:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603346161] [2023-12-02 18:59:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603346161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:59:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1160762375] [2023-12-02 18:59:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:59:40,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:59:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:59:40,886 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:59:40,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 19:00:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:00:42,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 19:00:42,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:00:42,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:00:42,644 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:00:42,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:00:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:00:42,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:00:42,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:00:43,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 19:00:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:00:44,319 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:00:44,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:00:44,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:00:44,652 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:00:44,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:00:44,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:00:44,869 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:00:44,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:00:44,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:00:44,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:00:44,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:00:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:00:44,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:00:45,010 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:00:45,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 19:00:45,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7888) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7889))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7888) .cse2 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 19:00:45,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7889))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7888) .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7888) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 19:00:46,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7982 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7889))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7982) .cse0 v_ArrVal_7888) .cse1 v_ArrVal_7891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7982 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7983))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7982) .cse6 v_ArrVal_7888) (select (select (store .cse7 .cse6 v_ArrVal_7889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7891))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 19:00:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1160762375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:00:46,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418600990] [2023-12-02 19:00:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:00:46,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:00:46,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:00:46,835 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:00:46,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 19:00:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:00:47,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 19:00:47,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:00:47,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:00:47,783 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:00:47,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:00:47,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:00:47,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:00:47,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 19:00:47,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 19:00:47,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:00:49,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:00:49,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 19:00:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:00:49,233 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 19:00:49,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 39 [2023-12-02 19:00:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:00:49,646 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-02 19:00:49,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2023-12-02 19:00:49,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:00:49,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 19:00:49,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 19:00:49,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 19:00:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:00:49,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:00:49,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:00:49,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 19:00:50,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8450) .cse0 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8450) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32))))))) is different from false [2023-12-02 19:00:52,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8545))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 (store (select .cse4 .cse0) (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8544) .cse0 v_ArrVal_8450) .cse1 v_ArrVal_8453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~mem35#1.offset| (_ BitVec 32)) (v_ArrVal_8545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8545))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8544) .cse6 v_ArrVal_8450) (select (select (store .cse7 .cse6 (store (select .cse7 .cse6) (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem35#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8453))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 19:00:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418600990] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:00:52,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:00:52,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 18 [2023-12-02 19:00:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219929590] [2023-12-02 19:00:52,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:00:52,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 19:00:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:00:52,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 19:00:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=391, Unknown=17, NotChecked=742, Total=1260 [2023-12-02 19:00:52,573 INFO L87 Difference]: Start difference. First operand 1290 states and 1447 transitions. Second operand has 19 states, 16 states have (on average 7.6875) internal successors, (123), 19 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:00:56,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:01:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:01:24,895 INFO L93 Difference]: Finished difference Result 1643 states and 1769 transitions. [2023-12-02 19:01:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:01:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.6875) internal successors, (123), 19 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-12-02 19:01:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:01:24,899 INFO L225 Difference]: With dead ends: 1643 [2023-12-02 19:01:24,899 INFO L226 Difference]: Without dead ends: 1643 [2023-12-02 19:01:24,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 303 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=181, Invalid=670, Unknown=17, NotChecked=938, Total=1806 [2023-12-02 19:01:24,900 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1117 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 7737 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 3594 SdHoareTripleChecker+Invalid, 7757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7737 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:01:24,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 3594 Invalid, 7757 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 7737 Invalid, 1 Unknown, 0 Unchecked, 31.5s Time] [2023-12-02 19:01:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2023-12-02 19:01:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1289. [2023-12-02 19:01:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 771 states have (on average 1.8313878080415045) internal successors, (1412), 1278 states have internal predecessors, (1412), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 19:01:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1446 transitions. [2023-12-02 19:01:24,916 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1446 transitions. Word has length 107 [2023-12-02 19:01:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:01:24,916 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1446 transitions. [2023-12-02 19:01:24,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.6875) internal successors, (123), 19 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 19:01:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1446 transitions. [2023-12-02 19:01:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 19:01:24,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:01:24,917 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:01:24,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 19:01:25,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (37)] Forceful destruction successful, exit code 0 [2023-12-02 19:01:25,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-12-02 19:01:25,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:01:25,518 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 19:01:25,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:01:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1681543265, now seen corresponding path program 1 times [2023-12-02 19:01:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:01:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490581039] [2023-12-02 19:01:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:01:25,519 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-12-02 19:01:25,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:01:25,520 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 19:01:25,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (40)] Waiting until timeout for monitored process [2023-12-02 19:01:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:01:26,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 19:01:26,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:01:26,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:01:27,122 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 19:01:27,122 INFO L378 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-12-02 19:01:27,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:01:27,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 19:01:28,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:01:28,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:01:28,993 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:01:28,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:01:29,151 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:01:29,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:01:29,313 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:01:29,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:01:29,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 19:01:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:01:29,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:01:31,642 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:01:31,667 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8983))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:01:31,692 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8983))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:01:31,720 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:01:31,749 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:01:32,266 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9030))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8982)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 19:01:32,273 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:01:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490581039] [2023-12-02 19:01:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490581039] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:01:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [265208238] [2023-12-02 19:01:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:01:32,273 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:01:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:01:32,274 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:01:32,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 19:02:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:02:54,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 19:02:54,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:02:54,606 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 19:02:54,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 19:02:55,568 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 19:02:55,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 19:02:55,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-02 19:02:56,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 19:02:58,546 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:02:58,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:02:58,962 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:02:58,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:02:59,225 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:02:59,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:02:59,502 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:02:59,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 19:02:59,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 19:02:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:02:59,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:03:01,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9468))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:03:01,867 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:03:01,893 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:03:01,923 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:03:02,519 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9515))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9468)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:03:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [265208238] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:03:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593630399] [2023-12-02 19:03:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:03:02,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:03:02,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:03:02,528 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:03:02,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 19:03:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:03:03,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 19:03:03,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:03:03,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:03:03,558 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:03:03,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:03:03,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:03:04,964 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:03:04,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:03:05,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:03:05,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:03:05,508 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:03:05,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:03:05,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 19:03:05,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 19:03:05,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 19:03:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:03:05,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:03:05,774 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9953) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 19:03:05,795 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9953) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 19:03:05,820 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9952))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:03:05,844 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 19:03:05,871 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9951))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:03:05,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9951))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 19:03:06,561 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 19:03:06,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2023-12-02 19:03:06,585 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9999))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9951)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9952)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9953)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 19:03:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593630399] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:03:06,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:03:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2023-12-02 19:03:06,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678639918] [2023-12-02 19:03:06,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:03:06,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 19:03:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:03:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 19:03:06,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1092, Unknown=21, NotChecked=1530, Total=2862 [2023-12-02 19:03:06,594 INFO L87 Difference]: Start difference. First operand 1289 states and 1446 transitions. Second operand has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 33 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:03:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:03:36,597 INFO L93 Difference]: Finished difference Result 2408 states and 2616 transitions. [2023-12-02 19:03:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 19:03:36,598 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 33 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 109 [2023-12-02 19:03:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:03:36,601 INFO L225 Difference]: With dead ends: 2408 [2023-12-02 19:03:36,601 INFO L226 Difference]: Without dead ends: 2408 [2023-12-02 19:03:36,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 299 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=307, Invalid=1814, Unknown=21, NotChecked=1890, Total=4032 [2023-12-02 19:03:36,603 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 3131 mSDsluCounter, 5427 mSDsCounter, 0 mSdLazyCounter, 7840 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 5938 SdHoareTripleChecker+Invalid, 7957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 7840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:03:36,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3154 Valid, 5938 Invalid, 7957 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [117 Valid, 7840 Invalid, 0 Unknown, 0 Unchecked, 29.0s Time] [2023-12-02 19:03:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2023-12-02 19:03:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1288. [2023-12-02 19:03:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 771 states have (on average 1.8300907911802853) internal successors, (1411), 1277 states have internal predecessors, (1411), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-12-02 19:03:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1445 transitions. [2023-12-02 19:03:36,619 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1445 transitions. Word has length 109 [2023-12-02 19:03:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:03:36,619 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1445 transitions. [2023-12-02 19:03:36,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 33 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 19:03:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1445 transitions. [2023-12-02 19:03:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 19:03:36,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:03:36,620 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:03:36,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 19:03:36,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 19:03:37,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (40)] Forceful destruction successful, exit code 0 [2023-12-02 19:03:37,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 19:03:37,221 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-12-02 19:03:37,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:03:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1681543266, now seen corresponding path program 1 times [2023-12-02 19:03:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:03:37,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033879226] [2023-12-02 19:03:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:03:37,222 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-12-02 19:03:37,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:03:37,223 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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-12-02 19:03:37,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/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 (43)] Waiting until timeout for monitored process [2023-12-02 19:03:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:03:38,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 19:03:38,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:03:38,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 19:03:38,959 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:03:38,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 19:03:38,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 19:03:39,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:03:39,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:03:39,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 19:03:39,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:03:40,448 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:03:40,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:03:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:03:40,659 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:03:40,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:03:40,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:03:40,839 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:03:40,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:03:40,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:03:41,011 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:03:41,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 19:03:41,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 19:03:41,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 19:03:41,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 19:03:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 19:03:41,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:03:41,373 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 19:03:41,421 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 19:03:41,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10484))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10483) .cse0 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10483) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 19:03:41,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10483) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10484))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10483) .cse3 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 19:03:43,442 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10481))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10482) .cse1 v_ArrVal_10483) (select (select (store .cse2 .cse1 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10486))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10481))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10484))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10482) .cse4 v_ArrVal_10483) .cse5 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 19:03:44,218 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10481))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10482) .cse2 v_ArrVal_10483) (select (select (store .cse3 .cse2 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10486))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10481))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10484))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10482) .cse5 v_ArrVal_10483) .cse6 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 19:03:46,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10578 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10578))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10481))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10484))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10577) .cse0 v_ArrVal_10482) .cse1 v_ArrVal_10483) .cse2 v_ArrVal_10486) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10485) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10578 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10578))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10481))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10577) .cse8 v_ArrVal_10482) .cse9 v_ArrVal_10483) (select (select (store .cse10 .cse9 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10486))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 19:03:46,863 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:03:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033879226] [2023-12-02 19:03:46,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033879226] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:03:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [183643581] [2023-12-02 19:03:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:03:46,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:03:46,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:03:46,865 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:03:46,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcac30f9-fa09-49e5-9511-45d3f936c11a/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process