./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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_eb849411-ab0c-469f-a7f5-a051ff87f381/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:50:33,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:50:33,681 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 16:50:33,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:50:33,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:50:33,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:50:33,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:50:33,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:50:33,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:50:33,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:50:33,717 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:50:33,717 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:50:33,718 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:50:33,718 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:50:33,719 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:50:33,719 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:50:33,720 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:50:33,720 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:50:33,721 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:50:33,721 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:50:33,722 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:50:33,725 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:50:33,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:50:33,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:50:33,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:50:33,727 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:50:33,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:50:33,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:50:33,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:50:33,729 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:50:33,729 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:50:33,729 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:50:33,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:50:33,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:50:33,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:50:33,730 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:50:33,731 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:50:33,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:50:33,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:50:33,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:50:33,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:50:33,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:50:33,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:50:33,732 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:50:33,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:50:33,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:50:33,733 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:50:33,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:50:33,733 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_eb849411-ab0c-469f-a7f5-a051ff87f381/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_eb849411-ab0c-469f-a7f5-a051ff87f381/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2023-12-02 16:50:33,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:50:33,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:50:33,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:50:33,982 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:50:33,983 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:50:33,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2023-12-02 16:50:36,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:50:37,162 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:50:37,162 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2023-12-02 16:50:37,179 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data/963101066/4c5acff1596a4e5187a6f357f06b63f0/FLAGb10addf86 [2023-12-02 16:50:37,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data/963101066/4c5acff1596a4e5187a6f357f06b63f0 [2023-12-02 16:50:37,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:50:37,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:50:37,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:50:37,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:50:37,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:50:37,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:50:37" (1/1) ... [2023-12-02 16:50:37,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f382bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:37, skipping insertion in model container [2023-12-02 16:50:37,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:50:37" (1/1) ... [2023-12-02 16:50:37,281 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:50:37,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:50:37,713 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 16:50:37,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@43bb5e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:37, skipping insertion in model container [2023-12-02 16:50:37,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:50:37,715 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 16:50:37,717 INFO L158 Benchmark]: Toolchain (without parser) took 519.43ms. Allocated memory is still 169.9MB. Free memory was 128.2MB in the beginning and 111.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 16:50:37,717 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:50:37,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.82ms. Allocated memory is still 169.9MB. Free memory was 128.2MB in the beginning and 111.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 16:50:37,720 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.19ms. Allocated memory is still 109.1MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.82ms. Allocated memory is still 169.9MB. Free memory was 128.2MB in the beginning and 111.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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_eb849411-ab0c-469f-a7f5-a051ff87f381/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:50:39,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:50:39,634 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 16:50:39,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:50:39,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:50:39,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:50:39,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:50:39,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:50:39,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:50:39,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:50:39,672 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:50:39,673 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:50:39,674 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:50:39,675 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:50:39,675 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:50:39,676 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:50:39,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:50:39,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:50:39,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:50:39,679 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:50:39,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:50:39,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:50:39,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:50:39,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:50:39,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:50:39,681 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:50:39,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:50:39,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:50:39,683 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 16:50:39,683 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 16:50:39,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:50:39,684 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:50:39,684 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:50:39,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:50:39,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 16:50:39,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:50:39,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:50:39,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:50:39,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:50:39,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:50:39,686 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 16:50:39,687 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 16:50:39,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:50:39,687 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:50:39,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:50:39,688 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_eb849411-ab0c-469f-a7f5-a051ff87f381/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_eb849411-ab0c-469f-a7f5-a051ff87f381/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2023-12-02 16:50:40,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:50:40,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:50:40,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:50:40,046 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:50:40,047 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:50:40,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2023-12-02 16:50:42,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:50:43,138 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:50:43,139 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2023-12-02 16:50:43,158 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data/d9b2fdcfd/940f7065ba344f299066f23cff81f18a/FLAG8a02b68c4 [2023-12-02 16:50:43,171 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/data/d9b2fdcfd/940f7065ba344f299066f23cff81f18a [2023-12-02 16:50:43,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:50:43,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:50:43,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:50:43,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:50:43,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:50:43,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:43,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b129333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43, skipping insertion in model container [2023-12-02 16:50:43,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:43,240 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:50:43,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:50:43,632 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 16:50:43,648 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:50:43,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:50:43,719 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:50:43,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:50:43,865 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:50:43,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43 WrapperNode [2023-12-02 16:50:43,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:50:43,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:50:43,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:50:43,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:50:43,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:43,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:43,975 INFO L138 Inliner]: procedures = 180, calls = 177, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 591 [2023-12-02 16:50:43,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:50:43,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:50:43,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:50:43,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:50:43,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:43,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:43,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:43,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:44,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:44,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:44,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:44,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:44,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:50:44,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:50:44,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:50:44,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:50:44,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (1/1) ... [2023-12-02 16:50:44,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:50:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:50:44,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:50:44,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:50:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 16:50:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 16:50:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 16:50:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 16:50:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:50:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:50:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 16:50:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 16:50:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 16:50:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:50:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 16:50:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 16:50:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:50:44,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:50:44,328 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:50:44,330 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:50:44,335 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 16:50:47,129 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:50:47,289 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:50:47,289 INFO L309 CfgBuilder]: Removed 31 assume(true) statements. [2023-12-02 16:50:47,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:50:47 BoogieIcfgContainer [2023-12-02 16:50:47,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:50:47,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:50:47,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:50:47,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:50:47,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:50:43" (1/3) ... [2023-12-02 16:50:47,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb70042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:50:47, skipping insertion in model container [2023-12-02 16:50:47,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:50:43" (2/3) ... [2023-12-02 16:50:47,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb70042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:50:47, skipping insertion in model container [2023-12-02 16:50:47,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:50:47" (3/3) ... [2023-12-02 16:50:47,299 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2023-12-02 16:50:47,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:50:47,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2023-12-02 16:50:47,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:50:47,382 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;@6ef55434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:50:47,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2023-12-02 16:50:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 584 states, 252 states have (on average 2.5476190476190474) internal successors, (642), 579 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 16:50:47,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:47,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 16:50:47,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:47,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash 29780177, now seen corresponding path program 1 times [2023-12-02 16:50:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:47,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578793028] [2023-12-02 16:50:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:47,410 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 16:50:47,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:47,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:47,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:47,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 16:50:47,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:47,548 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 16:50:47,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:47,549 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:47,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578793028] [2023-12-02 16:50:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578793028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:47,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:47,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:50:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200031864] [2023-12-02 16:50:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:47,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 16:50:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 16:50:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 16:50:47,592 INFO L87 Difference]: Start difference. First operand has 584 states, 252 states have (on average 2.5476190476190474) internal successors, (642), 579 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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 16:50:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:48,113 INFO L93 Difference]: Finished difference Result 574 states and 601 transitions. [2023-12-02 16:50:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 16:50:48,117 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 16:50:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:48,128 INFO L225 Difference]: With dead ends: 574 [2023-12-02 16:50:48,128 INFO L226 Difference]: Without dead ends: 573 [2023-12-02 16:50:48,130 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 16:50:48,133 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:48,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 533 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:50:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-12-02 16:50:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2023-12-02 16:50:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 247 states have (on average 2.4048582995951415) internal successors, (594), 568 states have internal predecessors, (594), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 600 transitions. [2023-12-02 16:50:48,203 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 600 transitions. Word has length 4 [2023-12-02 16:50:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:48,203 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 600 transitions. [2023-12-02 16:50:48,204 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 16:50:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 600 transitions. [2023-12-02 16:50:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 16:50:48,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:48,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 16:50:48,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:48,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:48,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:48,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 29780239, now seen corresponding path program 1 times [2023-12-02 16:50:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:48,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433044418] [2023-12-02 16:50:48,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:48,407 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 16:50:48,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:48,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:48,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:48,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:50:48,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:48,548 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 16:50:48,563 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 16:50:48,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:48,563 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433044418] [2023-12-02 16:50:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433044418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:48,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:50:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866301052] [2023-12-02 16:50:48,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:48,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:50:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:48,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:50:48,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:50:48,567 INFO L87 Difference]: Start difference. First operand 573 states and 600 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 16:50:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:49,716 INFO L93 Difference]: Finished difference Result 534 states and 562 transitions. [2023-12-02 16:50:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:50:49,716 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 16:50:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:49,719 INFO L225 Difference]: With dead ends: 534 [2023-12-02 16:50:49,719 INFO L226 Difference]: Without dead ends: 534 [2023-12-02 16:50:49,720 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 16:50:49,721 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 515 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:49,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 245 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 16:50:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-12-02 16:50:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 524. [2023-12-02 16:50:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 247 states have (on average 2.2064777327935223) internal successors, (545), 519 states have internal predecessors, (545), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 551 transitions. [2023-12-02 16:50:49,737 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 551 transitions. Word has length 4 [2023-12-02 16:50:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:49,738 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 551 transitions. [2023-12-02 16:50:49,738 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 16:50:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 551 transitions. [2023-12-02 16:50:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 16:50:49,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:49,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 16:50:49,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:49,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:49,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:49,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash 29780240, now seen corresponding path program 1 times [2023-12-02 16:50:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:49,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132638525] [2023-12-02 16:50:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:49,943 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 16:50:49,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:49,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:49,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:50,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:50:50,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:50,019 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 16:50:50,040 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 16:50:50,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:50,040 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132638525] [2023-12-02 16:50:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132638525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:50,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:50:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200163048] [2023-12-02 16:50:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:50,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:50:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:50:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:50:50,043 INFO L87 Difference]: Start difference. First operand 524 states and 551 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 16:50:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:51,678 INFO L93 Difference]: Finished difference Result 583 states and 614 transitions. [2023-12-02 16:50:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:50:51,679 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 16:50:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:51,682 INFO L225 Difference]: With dead ends: 583 [2023-12-02 16:50:51,682 INFO L226 Difference]: Without dead ends: 583 [2023-12-02 16:50:51,683 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 16:50:51,684 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 231 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:51,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 526 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 16:50:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2023-12-02 16:50:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 536. [2023-12-02 16:50:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 270 states have (on average 2.188888888888889) internal successors, (591), 531 states have internal predecessors, (591), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 597 transitions. [2023-12-02 16:50:51,697 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 597 transitions. Word has length 4 [2023-12-02 16:50:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:51,697 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 597 transitions. [2023-12-02 16:50:51,697 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 16:50:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 597 transitions. [2023-12-02 16:50:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 16:50:51,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:51,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 16:50:51,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:51,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:51,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:51,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 924015758, now seen corresponding path program 1 times [2023-12-02 16:50:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103345248] [2023-12-02 16:50:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:51,900 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 16:50:51,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:51,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:51,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:51,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 16:50:51,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:51,962 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 16:50:51,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:51,963 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103345248] [2023-12-02 16:50:51,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103345248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:51,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:50:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524105035] [2023-12-02 16:50:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:51,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:50:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:50:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:50:51,965 INFO L87 Difference]: Start difference. First operand 536 states and 597 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 16:50:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:52,810 INFO L93 Difference]: Finished difference Result 1053 states and 1174 transitions. [2023-12-02 16:50:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:50:52,813 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 16:50:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:52,818 INFO L225 Difference]: With dead ends: 1053 [2023-12-02 16:50:52,819 INFO L226 Difference]: Without dead ends: 1053 [2023-12-02 16:50:52,819 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 16:50:52,820 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 513 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:52,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 941 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 16:50:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-12-02 16:50:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 537. [2023-12-02 16:50:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 271 states have (on average 2.1845018450184504) internal successors, (592), 532 states have internal predecessors, (592), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 598 transitions. [2023-12-02 16:50:52,842 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 598 transitions. Word has length 5 [2023-12-02 16:50:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:52,842 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 598 transitions. [2023-12-02 16:50:52,842 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 16:50:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 598 transitions. [2023-12-02 16:50:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 16:50:52,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:52,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:50:52,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:53,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:53,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:53,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 793464752, now seen corresponding path program 1 times [2023-12-02 16:50:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646510318] [2023-12-02 16:50:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:53,045 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 16:50:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:53,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:53,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:53,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 16:50:53,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:53,149 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 16:50:53,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:53,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646510318] [2023-12-02 16:50:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646510318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:53,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:53,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:50:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572006142] [2023-12-02 16:50:53,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:53,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:50:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:50:53,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:50:53,152 INFO L87 Difference]: Start difference. First operand 537 states and 598 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:50:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:53,799 INFO L93 Difference]: Finished difference Result 498 states and 558 transitions. [2023-12-02 16:50:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:50:53,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-12-02 16:50:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:53,804 INFO L225 Difference]: With dead ends: 498 [2023-12-02 16:50:53,805 INFO L226 Difference]: Without dead ends: 498 [2023-12-02 16:50:53,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:50:53,806 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 70 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:53,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 799 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 16:50:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-02 16:50:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2023-12-02 16:50:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 256 states have (on average 2.15625) internal successors, (552), 493 states have internal predecessors, (552), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 558 transitions. [2023-12-02 16:50:53,820 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 558 transitions. Word has length 11 [2023-12-02 16:50:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:53,820 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 558 transitions. [2023-12-02 16:50:53,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16:50:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 558 transitions. [2023-12-02 16:50:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 16:50:53,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:53,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:50:53,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Ended with exit code 0 [2023-12-02 16:50:54,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:54,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:54,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1984555990, now seen corresponding path program 1 times [2023-12-02 16:50:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:54,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15712812] [2023-12-02 16:50:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:54,023 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 16:50:54,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:54,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:54,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:54,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:50:54,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:54,131 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 16:50:54,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:54,131 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15712812] [2023-12-02 16:50:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15712812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:54,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:54,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:50:54,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3201387] [2023-12-02 16:50:54,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:54,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:50:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:54,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:50:54,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:50:54,133 INFO L87 Difference]: Start difference. First operand 498 states and 558 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 16:50:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:54,894 INFO L93 Difference]: Finished difference Result 484 states and 537 transitions. [2023-12-02 16:50:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:50:54,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2023-12-02 16:50:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:54,898 INFO L225 Difference]: With dead ends: 484 [2023-12-02 16:50:54,898 INFO L226 Difference]: Without dead ends: 484 [2023-12-02 16:50:54,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 16:50:54,899 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 58 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:54,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1155 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 16:50:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-12-02 16:50:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 483. [2023-12-02 16:50:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 255 states have (on average 2.0784313725490198) internal successors, (530), 478 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 536 transitions. [2023-12-02 16:50:54,912 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 536 transitions. Word has length 13 [2023-12-02 16:50:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:54,913 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 536 transitions. [2023-12-02 16:50:54,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 16:50:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 536 transitions. [2023-12-02 16:50:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 16:50:54,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:54,914 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] [2023-12-02 16:50:54,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Ended with exit code 0 [2023-12-02 16:50:55,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:55,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:55,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash 428175736, now seen corresponding path program 1 times [2023-12-02 16:50:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468364071] [2023-12-02 16:50:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:55,118 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 16:50:55,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:55,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:55,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:55,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:50:55,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:55,225 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 16:50:55,315 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 16:50:55,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:55,316 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468364071] [2023-12-02 16:50:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468364071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:55,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:50:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823934248] [2023-12-02 16:50:55,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:55,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:50:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:50:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:50:55,319 INFO L87 Difference]: Start difference. First operand 483 states and 536 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 16:50:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:56,618 INFO L93 Difference]: Finished difference Result 489 states and 543 transitions. [2023-12-02 16:50:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:50:56,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2023-12-02 16:50:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:56,620 INFO L225 Difference]: With dead ends: 489 [2023-12-02 16:50:56,620 INFO L226 Difference]: Without dead ends: 489 [2023-12-02 16:50:56,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 16:50:56,621 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 448 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:56,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 359 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 16:50:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-12-02 16:50:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 479. [2023-12-02 16:50:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 255 states have (on average 2.062745098039216) internal successors, (526), 474 states have internal predecessors, (526), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 532 transitions. [2023-12-02 16:50:56,630 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 532 transitions. Word has length 27 [2023-12-02 16:50:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:56,630 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 532 transitions. [2023-12-02 16:50:56,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 16:50:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 532 transitions. [2023-12-02 16:50:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 16:50:56,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:56,631 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] [2023-12-02 16:50:56,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:56,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:56,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:56,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash 428175737, now seen corresponding path program 1 times [2023-12-02 16:50:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:56,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154035963] [2023-12-02 16:50:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:56,833 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 16:50:56,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:56,834 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:56,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:56,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:50:56,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:56,953 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 16:50:57,150 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 16:50:57,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:57,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154035963] [2023-12-02 16:50:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154035963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:57,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:50:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104896649] [2023-12-02 16:50:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:50:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:50:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:50:57,152 INFO L87 Difference]: Start difference. First operand 479 states and 532 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 16:50:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:59,121 INFO L93 Difference]: Finished difference Result 522 states and 545 transitions. [2023-12-02 16:50:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:50:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2023-12-02 16:50:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:59,125 INFO L225 Difference]: With dead ends: 522 [2023-12-02 16:50:59,125 INFO L226 Difference]: Without dead ends: 522 [2023-12-02 16:50:59,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 16:50:59,126 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 167 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:59,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 651 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 16:50:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-12-02 16:50:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 475. [2023-12-02 16:50:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 255 states have (on average 2.0470588235294116) internal successors, (522), 470 states have internal predecessors, (522), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:50:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 528 transitions. [2023-12-02 16:50:59,137 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 528 transitions. Word has length 27 [2023-12-02 16:50:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:59,138 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 528 transitions. [2023-12-02 16:50:59,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 16:50:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 528 transitions. [2023-12-02 16:50:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 16:50:59,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:50:59,139 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] [2023-12-02 16:50:59,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:59,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:59,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:50:59,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:50:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash 601234418, now seen corresponding path program 1 times [2023-12-02 16:50:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:50:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996024870] [2023-12-02 16:50:59,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:50:59,341 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 16:50:59,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:50:59,342 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:59,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:50:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:50:59,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:50:59,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:50:59,570 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 16:50:59,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:50:59,571 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:50:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996024870] [2023-12-02 16:50:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996024870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:50:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:50:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:50:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005028394] [2023-12-02 16:50:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:50:59,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:50:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:50:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:50:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:50:59,573 INFO L87 Difference]: Start difference. First operand 475 states and 528 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 16:51:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:00,264 INFO L93 Difference]: Finished difference Result 469 states and 518 transitions. [2023-12-02 16:51:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:51:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2023-12-02 16:51:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:00,268 INFO L225 Difference]: With dead ends: 469 [2023-12-02 16:51:00,268 INFO L226 Difference]: Without dead ends: 469 [2023-12-02 16:51:00,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 16:51:00,269 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 23 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:00,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1141 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 16:51:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-12-02 16:51:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2023-12-02 16:51:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 249 states have (on average 2.0562248995983934) internal successors, (512), 464 states have internal predecessors, (512), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:51:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 518 transitions. [2023-12-02 16:51:00,279 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 518 transitions. Word has length 43 [2023-12-02 16:51:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:00,279 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 518 transitions. [2023-12-02 16:51:00,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 16:51:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 518 transitions. [2023-12-02 16:51:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 16:51:00,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:00,281 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] [2023-12-02 16:51:00,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:00,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:00,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:00,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash -927206061, now seen corresponding path program 1 times [2023-12-02 16:51:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705286226] [2023-12-02 16:51:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:00,483 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 16:51:00,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:00,484 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:00,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:00,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:51:00,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:00,908 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 16:51:00,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:51:00,909 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705286226] [2023-12-02 16:51:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705286226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:51:00,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:51:00,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:51:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918716905] [2023-12-02 16:51:00,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:51:00,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:51:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:00,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:51:00,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:51:00,911 INFO L87 Difference]: Start difference. First operand 469 states and 518 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 16:51:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:01,525 INFO L93 Difference]: Finished difference Result 513 states and 562 transitions. [2023-12-02 16:51:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:51:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2023-12-02 16:51:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:01,530 INFO L225 Difference]: With dead ends: 513 [2023-12-02 16:51:01,530 INFO L226 Difference]: Without dead ends: 513 [2023-12-02 16:51:01,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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 16:51:01,532 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 59 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:01,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 725 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 16:51:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-02 16:51:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2023-12-02 16:51:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 293 states have (on average 1.8976109215017065) internal successors, (556), 508 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:51:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 562 transitions. [2023-12-02 16:51:01,542 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 562 transitions. Word has length 47 [2023-12-02 16:51:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:01,542 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 562 transitions. [2023-12-02 16:51:01,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 16:51:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 562 transitions. [2023-12-02 16:51:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 16:51:01,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:01,544 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] [2023-12-02 16:51:01,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:01,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:01,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:01,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1568558487, now seen corresponding path program 1 times [2023-12-02 16:51:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943619101] [2023-12-02 16:51:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:01,751 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 16:51:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:01,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:01,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:02,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:51:02,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:02,112 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 16:51:02,122 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 16:51:02,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:51:02,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 16:51:02,651 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:51:02,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 16:51:02,689 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 16:51:02,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:51:02,689 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:02,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943619101] [2023-12-02 16:51:02,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943619101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:51:02,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:51:02,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:51:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899664603] [2023-12-02 16:51:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:51:02,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:51:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:51:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:51:02,692 INFO L87 Difference]: Start difference. First operand 513 states and 562 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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 16:51:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:04,006 INFO L93 Difference]: Finished difference Result 485 states and 535 transitions. [2023-12-02 16:51:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:51:04,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2023-12-02 16:51:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:04,009 INFO L225 Difference]: With dead ends: 485 [2023-12-02 16:51:04,009 INFO L226 Difference]: Without dead ends: 485 [2023-12-02 16:51:04,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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 16:51:04,010 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 354 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:04,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 125 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 16:51:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-12-02 16:51:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 452. [2023-12-02 16:51:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 270 states have (on average 1.7074074074074075) internal successors, (461), 447 states have internal predecessors, (461), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:51:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 467 transitions. [2023-12-02 16:51:04,021 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 467 transitions. Word has length 50 [2023-12-02 16:51:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:04,021 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 467 transitions. [2023-12-02 16:51:04,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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 16:51:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 467 transitions. [2023-12-02 16:51:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 16:51:04,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:04,023 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] [2023-12-02 16:51:04,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:04,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:04,225 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:04,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1931693872, now seen corresponding path program 1 times [2023-12-02 16:51:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:04,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194160931] [2023-12-02 16:51:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:04,226 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 16:51:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:04,227 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:04,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:04,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 16:51:04,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:04,431 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 16:51:04,452 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 16:51:04,464 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 16:51:04,507 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 16:51:04,526 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 16:51:04,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:51:04,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194160931] [2023-12-02 16:51:04,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194160931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:51:04,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:51:04,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:51:04,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189731514] [2023-12-02 16:51:04,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:51:04,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:51:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:04,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:51:04,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:51:04,529 INFO L87 Difference]: Start difference. First operand 452 states and 467 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 16:51:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:06,446 INFO L93 Difference]: Finished difference Result 451 states and 466 transitions. [2023-12-02 16:51:06,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:51:06,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2023-12-02 16:51:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:06,449 INFO L225 Difference]: With dead ends: 451 [2023-12-02 16:51:06,450 INFO L226 Difference]: Without dead ends: 451 [2023-12-02 16:51:06,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:51:06,450 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 3 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:06,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 911 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 16:51:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-12-02 16:51:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2023-12-02 16:51:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 270 states have (on average 1.7037037037037037) internal successors, (460), 446 states have internal predecessors, (460), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:51:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 466 transitions. [2023-12-02 16:51:06,457 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 466 transitions. Word has length 54 [2023-12-02 16:51:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:06,458 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 466 transitions. [2023-12-02 16:51:06,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 16:51:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 466 transitions. [2023-12-02 16:51:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 16:51:06,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:06,459 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] [2023-12-02 16:51:06,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:06,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:06,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:06,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1931693871, now seen corresponding path program 1 times [2023-12-02 16:51:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980843575] [2023-12-02 16:51:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:06,665 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 16:51:06,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:06,666 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:06,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:06,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:51:06,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:06,868 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 16:51:06,881 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 16:51:06,907 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 16:51:06,917 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 16:51:06,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:51:06,917 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980843575] [2023-12-02 16:51:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980843575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:51:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:51:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:51:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70240544] [2023-12-02 16:51:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:51:06,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:51:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:51:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:51:06,920 INFO L87 Difference]: Start difference. First operand 451 states and 466 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 16:51:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:08,517 INFO L93 Difference]: Finished difference Result 450 states and 465 transitions. [2023-12-02 16:51:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:51:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2023-12-02 16:51:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:08,520 INFO L225 Difference]: With dead ends: 450 [2023-12-02 16:51:08,520 INFO L226 Difference]: Without dead ends: 450 [2023-12-02 16:51:08,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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 16:51:08,520 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 1 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:08,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 899 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 16:51:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-12-02 16:51:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2023-12-02 16:51:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 269 states have (on average 1.7063197026022305) internal successors, (459), 445 states have internal predecessors, (459), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:51:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 465 transitions. [2023-12-02 16:51:08,527 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 465 transitions. Word has length 54 [2023-12-02 16:51:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:08,527 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 465 transitions. [2023-12-02 16:51:08,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 16:51:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 465 transitions. [2023-12-02 16:51:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 16:51:08,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:08,528 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 16:51:08,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:08,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:08,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:08,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2041358805, now seen corresponding path program 1 times [2023-12-02 16:51:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644271243] [2023-12-02 16:51:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:08,730 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 16:51:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:08,731 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:08,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:08,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:51:08,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:08,942 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 16:51:08,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:51:08,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644271243] [2023-12-02 16:51:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644271243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:51:08,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:51:08,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:51:08,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481894412] [2023-12-02 16:51:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:51:08,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:51:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:51:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:51:08,945 INFO L87 Difference]: Start difference. First operand 450 states and 465 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 16:51:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:09,757 INFO L93 Difference]: Finished difference Result 452 states and 468 transitions. [2023-12-02 16:51:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:51:09,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 60 [2023-12-02 16:51:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:09,763 INFO L225 Difference]: With dead ends: 452 [2023-12-02 16:51:09,763 INFO L226 Difference]: Without dead ends: 452 [2023-12-02 16:51:09,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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 16:51:09,764 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 1 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:09,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1080 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 16:51:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-12-02 16:51:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2023-12-02 16:51:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 270 states have (on average 1.7074074074074075) internal successors, (461), 447 states have internal predecessors, (461), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:51:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 468 transitions. [2023-12-02 16:51:09,776 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 468 transitions. Word has length 60 [2023-12-02 16:51:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:09,776 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 468 transitions. [2023-12-02 16:51:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 16:51:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 468 transitions. [2023-12-02 16:51:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 16:51:09,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:09,777 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, 1] [2023-12-02 16:51:09,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:09,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:09,978 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:09,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1406224572, now seen corresponding path program 1 times [2023-12-02 16:51:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108695580] [2023-12-02 16:51:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:09,979 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 16:51:09,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:09,979 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:09,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:10,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:51:10,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:10,195 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 16:51:10,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:10,260 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 16:51:10,260 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108695580] [2023-12-02 16:51:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108695580] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278480802] [2023-12-02 16:51:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:10,261 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:51:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:51:10,264 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:51:10,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 16:51:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:10,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:51:10,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:10,630 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 16:51:10,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:10,654 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 16:51:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [278480802] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152489048] [2023-12-02 16:51:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:10,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:51:10,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:51:10,656 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:51:10,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 16:51:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:10,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:51:10,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:10,867 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 16:51:10,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:10,892 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 16:51:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152489048] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:10,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 16:51:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 16:51:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583258813] [2023-12-02 16:51:10,893 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 16:51:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:51:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:51:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:51:10,895 INFO L87 Difference]: Start difference. First operand 452 states and 468 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 16:51:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:11,892 INFO L93 Difference]: Finished difference Result 461 states and 482 transitions. [2023-12-02 16:51:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:51:11,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 61 [2023-12-02 16:51:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:11,894 INFO L225 Difference]: With dead ends: 461 [2023-12-02 16:51:11,895 INFO L226 Difference]: Without dead ends: 461 [2023-12-02 16:51:11,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 354 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 16:51:11,895 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 6 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:11,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1793 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 16:51:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-12-02 16:51:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2023-12-02 16:51:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 277 states have (on average 1.711191335740072) internal successors, (474), 454 states have internal predecessors, (474), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:51:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 481 transitions. [2023-12-02 16:51:11,904 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 481 transitions. Word has length 61 [2023-12-02 16:51:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:11,904 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 481 transitions. [2023-12-02 16:51:11,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 16:51:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 481 transitions. [2023-12-02 16:51:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 16:51:11,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:11,905 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, 1] [2023-12-02 16:51:11,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 16:51:12,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 16:51:12,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Forceful destruction successful, exit code 0 [2023-12-02 16:51:12,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:12,506 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:12,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:12,507 INFO L85 PathProgramCache]: Analyzing trace with hash 760261525, now seen corresponding path program 2 times [2023-12-02 16:51:12,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:12,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656027298] [2023-12-02 16:51:12,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:51:12,507 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 16:51:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:12,508 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:12,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:12,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:51:12,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:51:12,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:51:12,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:12,919 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 16:51:12,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:13,058 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 16:51:13,067 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656027298] [2023-12-02 16:51:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656027298] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268275083] [2023-12-02 16:51:13,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:51:13,067 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:51:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:51:13,068 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:51:13,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 16:51:13,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:51:13,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:51:13,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:51:13,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:13,817 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 16:51:13,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:13,875 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 16:51:13,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [268275083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:13,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878825546] [2023-12-02 16:51:13,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:51:13,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:51:13,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:51:13,877 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:51:13,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 16:51:25,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:51:25,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:51:25,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 16:51:25,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:25,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:51:25,809 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 16:51:25,841 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 16:51:26,089 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:51:26,090 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 16:51:26,159 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 16:51:26,191 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 16:51:26,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:26,300 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 16:51:26,300 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 16:51:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878825546] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:51:26,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 16:51:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 16:51:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840445070] [2023-12-02 16:51:26,399 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 16:51:26,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 16:51:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 16:51:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=552, Unknown=7, NotChecked=0, Total=650 [2023-12-02 16:51:26,401 INFO L87 Difference]: Start difference. First operand 460 states and 481 transitions. Second operand has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 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 16:51:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:33,170 INFO L93 Difference]: Finished difference Result 484 states and 513 transitions. [2023-12-02 16:51:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 16:51:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 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 64 [2023-12-02 16:51:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:33,174 INFO L225 Difference]: With dead ends: 484 [2023-12-02 16:51:33,174 INFO L226 Difference]: Without dead ends: 482 [2023-12-02 16:51:33,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=2502, Unknown=10, NotChecked=0, Total=2970 [2023-12-02 16:51:33,176 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 393 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:33,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 2457 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-02 16:51:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-12-02 16:51:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 468. [2023-12-02 16:51:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 286 states have (on average 1.6958041958041958) internal successors, (485), 462 states have internal predecessors, (485), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:51:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 492 transitions. [2023-12-02 16:51:33,189 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 492 transitions. Word has length 64 [2023-12-02 16:51:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:33,189 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 492 transitions. [2023-12-02 16:51:33,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.714285714285714) internal successors, (120), 23 states have internal predecessors, (120), 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 16:51:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 492 transitions. [2023-12-02 16:51:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 16:51:33,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:33,191 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, 1] [2023-12-02 16:51:33,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 16:51:33,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 16:51:33,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Forceful destruction successful, exit code 0 [2023-12-02 16:51:33,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:33,792 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:33,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 343329334, now seen corresponding path program 1 times [2023-12-02 16:51:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100914368] [2023-12-02 16:51:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:33,793 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 16:51:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:33,794 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:33,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:34,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 16:51:34,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:34,198 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 16:51:34,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:34,650 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 16:51:34,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100914368] [2023-12-02 16:51:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100914368] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1785917831] [2023-12-02 16:51:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:34,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:51:34,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:51:34,652 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:51:34,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 16:51:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:35,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 16:51:35,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:35,176 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 16:51:35,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:35,312 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 16:51:35,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1785917831] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:35,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079527471] [2023-12-02 16:51:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:51:35,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:51:35,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:51:35,315 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:51:35,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 16:51:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:51:35,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 16:51:35,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:35,669 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 16:51:35,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:36,396 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 16:51:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079527471] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:36,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 16:51:36,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 16:51:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958493105] [2023-12-02 16:51:36,397 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 16:51:36,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 16:51:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 16:51:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 16:51:36,400 INFO L87 Difference]: Start difference. First operand 468 states and 492 transitions. Second operand has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 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 16:51:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:51:40,979 INFO L93 Difference]: Finished difference Result 498 states and 537 transitions. [2023-12-02 16:51:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 16:51:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 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 70 [2023-12-02 16:51:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:51:40,983 INFO L225 Difference]: With dead ends: 498 [2023-12-02 16:51:40,983 INFO L226 Difference]: Without dead ends: 495 [2023-12-02 16:51:40,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 378 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 16:51:40,985 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 24 mSDsluCounter, 4282 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4640 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:51:40,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4640 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-02 16:51:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-12-02 16:51:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 486. [2023-12-02 16:51:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 304 states have (on average 1.6710526315789473) internal successors, (508), 480 states have internal predecessors, (508), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:51:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 515 transitions. [2023-12-02 16:51:40,995 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 515 transitions. Word has length 70 [2023-12-02 16:51:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:51:40,996 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 515 transitions. [2023-12-02 16:51:40,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 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 16:51:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 515 transitions. [2023-12-02 16:51:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-02 16:51:40,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:51:40,997 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, 1] [2023-12-02 16:51:41,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-12-02 16:51:41,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:41,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 16:51:41,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:51:41,598 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:51:41,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:51:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1556127606, now seen corresponding path program 2 times [2023-12-02 16:51:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:51:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132731393] [2023-12-02 16:51:41,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:51:41,599 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 16:51:41,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:51:41,600 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:41,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:51:42,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:51:42,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:51:42,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 16:51:42,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:42,495 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 16:51:42,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:44,487 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 16:51:44,488 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:51:44,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132731393] [2023-12-02 16:51:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132731393] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:44,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [390122091] [2023-12-02 16:51:44,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:51:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:51:44,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:51:44,489 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:51:44,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 16:51:45,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:51:45,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:51:45,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 16:51:45,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:45,524 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 16:51:45,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:46,032 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 16:51:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [390122091] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:51:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868168362] [2023-12-02 16:51:46,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 16:51:46,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:51:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:51:46,033 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:51:46,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 16:51:55,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 16:51:55,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:51:55,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 16:51:55,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:51:55,527 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:51:55,528 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 16:51:55,535 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 16:51:55,629 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 16:51:55,634 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 16:51:55,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 16:51:55,929 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 16:51:56,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:51:56,470 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 16:51:56,481 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 16:51:56,652 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 16:51:56,660 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 16:51:56,750 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 16:51:56,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:51:57,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2459) |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~mem34#1.base| v_ArrVal_2459) |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~mem34#1.base| v_ArrVal_2460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:51:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868168362] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:51:57,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 16:51:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 16:51:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405835858] [2023-12-02 16:51:57,656 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 16:51:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 16:51:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:51:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 16:51:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 16:51:57,659 INFO L87 Difference]: Start difference. First operand 486 states and 515 transitions. Second operand has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 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 16:52:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:52:30,085 INFO L93 Difference]: Finished difference Result 558 states and 628 transitions. [2023-12-02 16:52:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-02 16:52:30,086 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 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 82 [2023-12-02 16:52:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:52:30,090 INFO L225 Difference]: With dead ends: 558 [2023-12-02 16:52:30,090 INFO L226 Difference]: Without dead ends: 551 [2023-12-02 16:52:30,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3457, Invalid=16568, Unknown=1, NotChecked=280, Total=20306 [2023-12-02 16:52:30,098 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 430 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 12112 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 5795 SdHoareTripleChecker+Invalid, 12183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 12112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:52:30,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 5795 Invalid, 12183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 12112 Invalid, 0 Unknown, 0 Unchecked, 21.7s Time] [2023-12-02 16:52:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2023-12-02 16:52:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 521. [2023-12-02 16:52:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 340 states have (on average 1.6205882352941177) internal successors, (551), 515 states have internal predecessors, (551), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:52:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 558 transitions. [2023-12-02 16:52:30,116 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 558 transitions. Word has length 82 [2023-12-02 16:52:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:52:30,117 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 558 transitions. [2023-12-02 16:52:30,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 58 states have internal predecessors, (156), 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 16:52:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 558 transitions. [2023-12-02 16:52:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 16:52:30,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:52:30,118 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] [2023-12-02 16:52:30,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Ended with exit code 0 [2023-12-02 16:52:30,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 16:52:30,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 16:52:30,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:52:30,719 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:52:30,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:52:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1592408096, now seen corresponding path program 1 times [2023-12-02 16:52:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:52:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887934024] [2023-12-02 16:52:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:52:30,720 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 16:52:30,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:52:30,721 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:52:30,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:52:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:52:31,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 16:52:31,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:52:31,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 16:52:31,601 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:52:31,601 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 16:52:31,634 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 16:52:31,725 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 16:52:32,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:52:32,581 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 16:52:32,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:52:32,688 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 16:52:32,705 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 16:52:32,739 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 16:52:32,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:52:32,789 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2867 (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_2867) |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 16:52:32,798 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 16:52:33,167 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~mem34#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 16:52:33,169 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:52:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887934024] [2023-12-02 16:52:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887934024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:52:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2064385549] [2023-12-02 16:52:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:52:33,169 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:52:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:52:33,170 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:52:33,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 16:52:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:52:35,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 16:52:35,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:52:35,720 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:52:35,720 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 16:52:36,162 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 16:52:36,162 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 16:52:36,241 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 16:52:36,430 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 16:52:37,740 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:52:37,740 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 16:52:37,954 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:52:37,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 16:52:37,995 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 16:52:38,052 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 16:52:38,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:52:40,136 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3320 (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_3320) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:52:40,519 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3366 (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~mem34#1.base| v_ArrVal_3366))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3320)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:52:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2064385549] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:52:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15928530] [2023-12-02 16:52:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:52:40,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:52:40,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:52:40,523 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:52:40,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 16:52:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:52:41,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 16:52:41,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:52:41,136 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:52:41,136 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 16:52:41,180 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 16:52:41,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:52:41,859 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 16:52:42,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:52:42,006 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 16:52:42,017 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 16:52:42,021 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 16:52:42,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:52:44,478 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 16:52:44,478 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 16:52:44,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem34#1.base| (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~mem34#1.base| v_ArrVal_3817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3320)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 16:52:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15928530] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:52:44,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:52:44,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 28 [2023-12-02 16:52:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079811990] [2023-12-02 16:52:44,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:52:44,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 16:52:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:52:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 16:52:44,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=797, Unknown=10, NotChecked=378, Total=1332 [2023-12-02 16:52:44,491 INFO L87 Difference]: Start difference. First operand 521 states and 558 transitions. Second operand has 29 states, 25 states have (on average 6.56) internal successors, (164), 28 states have internal predecessors, (164), 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 16:52:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:52:53,127 INFO L93 Difference]: Finished difference Result 956 states and 1029 transitions. [2023-12-02 16:52:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 16:52:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 6.56) internal successors, (164), 28 states have internal predecessors, (164), 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 106 [2023-12-02 16:52:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:52:53,133 INFO L225 Difference]: With dead ends: 956 [2023-12-02 16:52:53,133 INFO L226 Difference]: Without dead ends: 956 [2023-12-02 16:52:53,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 295 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=245, Invalid=1575, Unknown=10, NotChecked=522, Total=2352 [2023-12-02 16:52:53,134 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 1225 mSDsluCounter, 2719 mSDsCounter, 0 mSdLazyCounter, 4193 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 4227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:52:53,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 2896 Invalid, 4227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4193 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-12-02 16:52:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-12-02 16:52:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 520. [2023-12-02 16:52:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 340 states have (on average 1.6176470588235294) internal successors, (550), 514 states have internal predecessors, (550), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:52:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 557 transitions. [2023-12-02 16:52:53,146 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 557 transitions. Word has length 106 [2023-12-02 16:52:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:52:53,146 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 557 transitions. [2023-12-02 16:52:53,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 6.56) internal successors, (164), 28 states have internal predecessors, (164), 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 16:52:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 557 transitions. [2023-12-02 16:52:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 16:52:53,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:52:53,148 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] [2023-12-02 16:52:53,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 16:52:53,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 16:52:53,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Forceful destruction successful, exit code 0 [2023-12-02 16:52:53,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:52:53,749 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:52:53,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:52:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1592408095, now seen corresponding path program 1 times [2023-12-02 16:52:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:52:53,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944291564] [2023-12-02 16:52:53,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:52:53,750 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 16:52:53,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:52:53,751 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:52:53,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:52:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:52:54,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 16:52:54,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:52:54,581 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 16:52:54,677 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 16:52:54,692 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:52:54,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 16:52:54,717 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 16:52:54,731 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 16:52:54,837 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 16:52:54,842 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 16:52:55,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:52:55,579 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 16:52:55,586 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 16:52:55,722 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:52:55,722 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 16:52:55,736 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 16:52:55,748 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 16:52:55,753 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 16:52:55,784 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 16:52:55,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:52:55,943 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4269) |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_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:52:55,976 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_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4269) |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_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4269) |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 16:52:57,243 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_4269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4361))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4362) .cse0 v_ArrVal_4269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4362) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 16:52:57,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:52:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944291564] [2023-12-02 16:52:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944291564] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:52:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078885365] [2023-12-02 16:52:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:52:57,252 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:52:57,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:52:57,253 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:52:57,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 16:54:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:56,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 16:54:56,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:56,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 16:54:56,714 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:54:56,715 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 16:54:56,724 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 16:54:56,778 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 16:54:56,786 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 16:54:56,932 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 16:54:56,936 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 16:54:57,468 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:54:57,469 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 16:54:57,478 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 16:54:57,645 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:54:57,646 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 16:54:57,651 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 16:54:57,669 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 16:54:57,673 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 16:54:57,677 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 16:54:57,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:57,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-12-02 16:54:57,761 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_4814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-12-02 16:54:58,996 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4906))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4907) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4907) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4815) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 16:54:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1078885365] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219614279] [2023-12-02 16:54:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:59,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:59,008 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:59,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 16:54:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:59,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 16:54:59,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:59,700 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 16:54:59,713 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:54:59,714 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 16:54:59,725 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 16:54:59,737 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 16:54:59,792 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 16:54:59,797 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 16:55:00,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:00,559 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 16:55:00,571 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 16:55:00,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:00,661 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 16:55:00,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 30 treesize of output 13 [2023-12-02 16:55:00,689 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 16:55:00,694 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 16:55:00,701 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 16:55:00,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:00,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5358) |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 16:55:00,801 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_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 16:55:02,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5451 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5450))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5451) .cse0 v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5451 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5451) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5450) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 16:55:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219614279] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:02,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:55:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15 [2023-12-02 16:55:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949267898] [2023-12-02 16:55:02,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:55:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 16:55:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:55:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 16:55:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=263, Unknown=9, NotChecked=360, Total=702 [2023-12-02 16:55:02,111 INFO L87 Difference]: Start difference. First operand 520 states and 557 transitions. Second operand has 16 states, 13 states have (on average 11.076923076923077) internal successors, (144), 16 states have internal predecessors, (144), 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 16:55:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:06,999 INFO L93 Difference]: Finished difference Result 529 states and 567 transitions. [2023-12-02 16:55:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 16:55:06,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 11.076923076923077) internal successors, (144), 16 states have internal predecessors, (144), 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 106 [2023-12-02 16:55:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:07,002 INFO L225 Difference]: With dead ends: 529 [2023-12-02 16:55:07,002 INFO L226 Difference]: Without dead ends: 529 [2023-12-02 16:55:07,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 303 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=461, Unknown=9, NotChecked=468, Total=1056 [2023-12-02 16:55:07,002 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 644 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:07,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 724 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-02 16:55:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-12-02 16:55:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 519. [2023-12-02 16:55:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 340 states have (on average 1.6147058823529412) internal successors, (549), 513 states have internal predecessors, (549), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:55:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 556 transitions. [2023-12-02 16:55:07,013 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 556 transitions. Word has length 106 [2023-12-02 16:55:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:07,013 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 556 transitions. [2023-12-02 16:55:07,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 11.076923076923077) internal successors, (144), 16 states have internal predecessors, (144), 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 16:55:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 556 transitions. [2023-12-02 16:55:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 16:55:07,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:07,014 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] [2023-12-02 16:55:07,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Ended with exit code 0 [2023-12-02 16:55:07,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 16:55:07,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 16:55:07,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:07,615 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:55:07,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:07,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1295165883, now seen corresponding path program 1 times [2023-12-02 16:55:07,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:55:07,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883770786] [2023-12-02 16:55:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:07,616 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 16:55:07,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:55:07,617 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:55:07,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:55:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:08,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 16:55:08,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:08,484 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 16:55:08,589 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:55:08,590 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 16:55:08,634 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 16:55:08,739 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 16:55:09,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:09,682 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 16:55:09,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:09,796 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 16:55:09,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:09,867 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 16:55:09,880 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 16:55:09,912 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 16:55:09,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:09,965 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5874 (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_5874) |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 16:55:09,975 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5874 (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_5874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:55:09,987 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5874 (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_5873))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5874)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:55:09,999 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5874 (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_5873))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5874)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:55:10,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5874 (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| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5920))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5873)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5874)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:55:10,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:55:10,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883770786] [2023-12-02 16:55:10,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883770786] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:10,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [971110317] [2023-12-02 16:55:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:10,342 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:55:10,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:55:10,343 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:55:10,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 16:55:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:33,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 16:55:33,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:33,762 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:55:33,763 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 16:55:34,268 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 16:55:34,269 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 16:55:34,388 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 16:55:34,604 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 16:55:36,047 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:55:36,047 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 16:55:36,306 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:55:36,307 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 16:55:36,444 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:55:36,445 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 16:55:36,466 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 16:55:36,547 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 16:55:36,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:36,561 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6343) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:55:36,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6343 (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_6343) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:55:36,588 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6343 (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_6342))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6343)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:55:36,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6343 (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_6342))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6343)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:55:37,022 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6389 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6343 (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~mem34#1.base| v_ArrVal_6389))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6342)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6343)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:55:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [971110317] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801007773] [2023-12-02 16:55:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:37,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:37,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:55:37,028 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:55:37,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 16:55:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:37,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 16:55:37,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:37,822 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:55:37,823 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 16:55:37,874 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 16:55:38,604 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:38,604 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 16:55:38,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:38,801 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 16:55:38,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:38,920 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 16:55:38,932 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 16:55:38,937 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 16:55:38,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:38,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6810) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-12-02 16:55:38,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6810 (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_6810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:55:38,985 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (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_6809))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6810)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:55:38,999 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6809))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6810)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 16:55:39,445 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-12-02 16:55:39,446 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 61 treesize of output 60 [2023-12-02 16:55:39,462 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem34#1.base| (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~mem34#1.base| v_ArrVal_6856))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6809)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6810)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 16:55:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801007773] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:39,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:55:39,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 31 [2023-12-02 16:55:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747241723] [2023-12-02 16:55:39,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:55:39,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 16:55:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:55:39,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 16:55:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=916, Unknown=15, NotChecked=1140, Total=2256 [2023-12-02 16:55:39,468 INFO L87 Difference]: Start difference. First operand 519 states and 556 transitions. Second operand has 32 states, 28 states have (on average 6.071428571428571) internal successors, (170), 31 states have internal predecessors, (170), 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 16:55:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:51,033 INFO L93 Difference]: Finished difference Result 952 states and 1025 transitions. [2023-12-02 16:55:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 16:55:51,034 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 6.071428571428571) internal successors, (170), 31 states have internal predecessors, (170), 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 108 [2023-12-02 16:55:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:51,039 INFO L225 Difference]: With dead ends: 952 [2023-12-02 16:55:51,039 INFO L226 Difference]: Without dead ends: 952 [2023-12-02 16:55:51,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=284, Invalid=1741, Unknown=15, NotChecked=1500, Total=3540 [2023-12-02 16:55:51,042 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 933 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 4874 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 4899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:51,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 3357 Invalid, 4899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4874 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-12-02 16:55:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2023-12-02 16:55:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 518. [2023-12-02 16:55:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 340 states have (on average 1.611764705882353) internal successors, (548), 512 states have internal predecessors, (548), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:55:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 555 transitions. [2023-12-02 16:55:51,056 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 555 transitions. Word has length 108 [2023-12-02 16:55:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:51,056 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 555 transitions. [2023-12-02 16:55:51,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 6.071428571428571) internal successors, (170), 31 states have internal predecessors, (170), 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 16:55:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 555 transitions. [2023-12-02 16:55:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 16:55:51,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:51,057 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] [2023-12-02 16:55:51,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 16:55:51,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:55:51,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-12-02 16:55:51,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:55:51,658 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:55:51,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1295165882, now seen corresponding path program 1 times [2023-12-02 16:55:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:55:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104172082] [2023-12-02 16:55:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:51,660 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 16:55:51,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:55:51,661 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:55:51,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:55:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:52,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 16:55:52,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:52,674 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 16:55:52,795 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:55:52,796 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 16:55:52,801 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 16:55:52,823 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 16:55:52,828 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 16:55:52,935 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 16:55:52,939 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 16:55:53,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:53,619 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 16:55:53,628 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 16:55:53,718 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:53,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 16:55:53,732 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 16:55:53,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:55:53,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 16:55:53,816 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 16:55:53,833 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 16:55:53,839 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 16:55:53,866 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 16:55:53,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:54,255 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_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 16:55:54,296 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7324))) (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_7323) .cse0 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (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_7323) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7325) |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 16:55:54,334 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_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7324))) (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_7323) .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7323) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7325) |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 16:55:57,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7417))) (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~mem34#1.base| v_ArrVal_7418) .cse1 v_ArrVal_7323) (select (select (store .cse2 .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7325))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7417))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7324))) (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~mem34#1.base| v_ArrVal_7418) .cse4 v_ArrVal_7323) .cse5 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 16:55:57,076 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:55:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104172082] [2023-12-02 16:55:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104172082] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [730369377] [2023-12-02 16:55:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:57,076 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:55:57,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:55:57,077 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:55:57,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 16:56:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:56,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 16:56:56,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:56,208 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 16:56:56,728 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 16:56:56,759 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:56:56,759 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 16:56:56,860 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 16:56:56,867 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 16:56:57,174 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 16:56:57,182 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 16:56:58,302 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:56:58,302 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 16:56:58,311 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 16:56:58,634 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:56:58,635 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 16:56:58,643 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 16:56:58,841 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:56:58,842 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 16:56:58,859 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 16:56:58,874 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 16:56:58,885 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 16:56:58,891 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 16:56:58,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:58,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7888) |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~mem37#1.base| v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:56:59,006 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_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 16:56:59,059 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7885))) (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_7886) .cse0 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (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_7886) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 16:56:59,112 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_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7886) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7885))) (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_7886) .cse3 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 16:57:00,724 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7979))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7885))) (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~mem34#1.base| v_ArrVal_7980) .cse0 v_ArrVal_7886) .cse1 v_ArrVal_7888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7979))) (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~mem34#1.base| v_ArrVal_7980) .cse6 v_ArrVal_7886) (select (select (store .cse7 .cse6 v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7888))) |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 16:57:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [730369377] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:00,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777555873] [2023-12-02 16:57:00,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:00,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:00,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:57:00,739 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:57:00,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 16:57:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:01,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 16:57:01,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:57:01,660 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 16:57:01,692 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:57:01,692 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 16:57:01,716 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 16:57:01,731 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 16:57:01,818 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 16:57:01,826 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 16:57:02,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:57:02,943 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 16:57:02,963 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 16:57:03,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:57:03,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 16:57:03,097 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 16:57:03,183 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:57:03,183 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 16:57:03,204 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 16:57:03,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 16:57:03,234 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 16:57:03,242 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 16:57:03,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:57:03,317 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 16:57:03,359 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_8449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 16:57:03,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8447) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8446))) (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~mem36#1.base| v_ArrVal_8447) .cse2 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 16:57:03,465 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_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8447) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8446))) (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_8447) .cse3 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 16:57:04,977 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8540))) (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~mem34#1.base| v_ArrVal_8541) .cse1 v_ArrVal_8447) (select (select (store .cse2 .cse1 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8449))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8540))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8446))) (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~mem34#1.base| v_ArrVal_8541) .cse4 v_ArrVal_8447) .cse5 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 16:57:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777555873] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:04,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:57:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 17 [2023-12-02 16:57:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693812824] [2023-12-02 16:57:04,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:57:04,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 16:57:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:57:04,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 16:57:04,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=359, Unknown=23, NotChecked=714, Total=1190 [2023-12-02 16:57:04,995 INFO L87 Difference]: Start difference. First operand 518 states and 555 transitions. Second operand has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 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 16:57:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:57:14,298 INFO L93 Difference]: Finished difference Result 527 states and 565 transitions. [2023-12-02 16:57:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 16:57:14,299 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 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 108 [2023-12-02 16:57:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:57:14,302 INFO L225 Difference]: With dead ends: 527 [2023-12-02 16:57:14,302 INFO L226 Difference]: Without dead ends: 527 [2023-12-02 16:57:14,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 307 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=153, Invalid=636, Unknown=23, NotChecked=910, Total=1722 [2023-12-02 16:57:14,303 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 634 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:57:14,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 902 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-12-02 16:57:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-12-02 16:57:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 517. [2023-12-02 16:57:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 340 states have (on average 1.6088235294117648) internal successors, (547), 511 states have internal predecessors, (547), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:57:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 554 transitions. [2023-12-02 16:57:14,315 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 554 transitions. Word has length 108 [2023-12-02 16:57:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:57:14,315 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 554 transitions. [2023-12-02 16:57:14,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 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 16:57:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 554 transitions. [2023-12-02 16:57:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 16:57:14,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:57:14,316 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, 1] [2023-12-02 16:57:14,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-12-02 16:57:14,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Ended with exit code 0 [2023-12-02 16:57:14,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 16:57:14,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:14,921 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:57:14,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:57:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash 886753732, now seen corresponding path program 1 times [2023-12-02 16:57:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:57:14,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318592293] [2023-12-02 16:57:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:14,923 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 16:57:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:57:14,924 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:57:14,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:57:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:16,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 16:57:16,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:57:16,018 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 16:57:16,258 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:57:16,259 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 16:57:16,310 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 16:57:16,473 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 16:57:17,887 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:57:17,887 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 16:57:18,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:57:18,087 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 16:57:18,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:57:18,236 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 16:57:18,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:57:18,382 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 16:57:18,418 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 16:57:18,491 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 16:57:18,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:57:18,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8980) |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 16:57:18,618 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (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_8980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 16:57:18,640 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (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~mem37#1.base| v_ArrVal_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:57:18,661 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (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_8979))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:57:18,685 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (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 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 16:57:18,711 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (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_8978))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:57:19,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9026 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9026))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8978)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8979)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8980)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:57:19,258 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:57:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318592293] [2023-12-02 16:57:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318592293] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [236062857] [2023-12-02 16:57:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:19,258 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:57:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:57:19,259 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:57:19,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 16:58:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:58:31,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-02 16:58:31,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:58:31,788 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:58:31,789 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 16:58:32,664 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 16:58:32,665 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 16:58:32,811 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 16:58:33,174 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 16:58:35,399 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:58:35,400 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 16:58:35,807 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:58:35,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 41 [2023-12-02 16:58:36,049 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:58:36,049 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 16:58:36,290 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:58:36,291 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 16:58:36,340 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 16:58:36,472 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 16:58:36,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:58:39,162 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (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~mem37#1.base| v_ArrVal_9465))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:58:39,184 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (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_9465))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:58:39,208 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (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~mem36#1.base| v_ArrVal_9464))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:58:39,232 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (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_9464))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:58:39,769 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9512))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:58:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [236062857] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:58:39,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534709098] [2023-12-02 16:58:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:58:39,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:58:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:58:39,788 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:58:39,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 16:58:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:58:40,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 16:58:40,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:58:40,759 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:58:40,760 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 16:58:40,853 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 16:58:42,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:58:42,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 16:58:44,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:58:44,388 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 16:58:44,575 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:58:44,575 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 16:58:44,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 16:58:44,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 16:58:44,785 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 16:58:44,808 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 16:58:44,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:58:46,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (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~mem37#1.base| v_ArrVal_9948))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:58:47,003 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (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_9948))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:58:47,029 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (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~mem36#1.base| v_ArrVal_9947))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 16:58:47,057 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (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_9947))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 16:58:47,650 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 16:58:47,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2023-12-02 16:58:47,672 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem34#1.base| (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~mem34#1.base| v_ArrVal_9995))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9947)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9466)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 16:58:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534709098] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:58:47,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:58:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 34 [2023-12-02 16:58:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045284895] [2023-12-02 16:58:47,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:58:47,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 16:58:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:58:47,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 16:58:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1216, Unknown=22, NotChecked=1496, Total=2970 [2023-12-02 16:58:47,680 INFO L87 Difference]: Start difference. First operand 517 states and 554 transitions. Second operand has 35 states, 31 states have (on average 5.67741935483871) internal successors, (176), 34 states have internal predecessors, (176), 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 16:59:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:59:02,849 INFO L93 Difference]: Finished difference Result 948 states and 1021 transitions. [2023-12-02 16:59:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 16:59:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 5.67741935483871) internal successors, (176), 34 states have internal predecessors, (176), 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 110 [2023-12-02 16:59:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:59:02,854 INFO L225 Difference]: With dead ends: 948 [2023-12-02 16:59:02,854 INFO L226 Difference]: Without dead ends: 948 [2023-12-02 16:59:02,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 301 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=338, Invalid=2158, Unknown=22, NotChecked=1904, Total=4422 [2023-12-02 16:59:02,856 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 925 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 3980 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:59:02,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 2709 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3980 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2023-12-02 16:59:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2023-12-02 16:59:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 516. [2023-12-02 16:59:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 340 states have (on average 1.6058823529411765) internal successors, (546), 510 states have internal predecessors, (546), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 16:59:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 553 transitions. [2023-12-02 16:59:02,867 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 553 transitions. Word has length 110 [2023-12-02 16:59:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:59:02,867 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 553 transitions. [2023-12-02 16:59:02,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 5.67741935483871) internal successors, (176), 34 states have internal predecessors, (176), 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 16:59:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 553 transitions. [2023-12-02 16:59:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 16:59:02,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:59:02,868 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, 1] [2023-12-02 16:59:02,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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)] Ended with exit code 0 [2023-12-02 16:59:03,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 16:59:03,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 16:59:03,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 16:59:03,469 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-12-02 16:59:03,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:59:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 886753733, now seen corresponding path program 1 times [2023-12-02 16:59:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:59:03,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878347819] [2023-12-02 16:59:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:59:03,470 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 16:59:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:59:03,471 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:59:03,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/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 16:59:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:59:04,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 16:59:04,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:59:04,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:59:05,174 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 16:59:05,212 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:59:05,213 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 16:59:05,260 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 16:59:05,289 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 16:59:05,470 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 16:59:05,477 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 16:59:06,555 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:59:06,555 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 16:59:06,572 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 16:59:06,767 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:59:06,768 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 16:59:06,776 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 16:59:06,948 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:59:06,948 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 16:59:06,956 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 16:59:07,121 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:59:07,122 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 16:59:07,139 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 16:59:07,166 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 16:59:07,172 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 16:59:07,232 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 16:59:07,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:59:07,467 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10482) |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~mem38#1.base| v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 16:59:07,512 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_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 16:59:07,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10480))) (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~mem37#1.base| v_ArrVal_10479) .cse0 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10479) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10482) |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 16:59:07,637 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_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10480))) (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_10479) .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10479) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 16:59:08,267 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10478))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10480))) (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~mem36#1.base| v_ArrVal_10477) .cse0 v_ArrVal_10479) .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10478))) (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~mem36#1.base| v_ArrVal_10477) .cse6 v_ArrVal_10479) (select (select (store .cse7 .cse6 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10482))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-12-02 16:59:08,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (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|) .cse3))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10478))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10480))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10477) .cse1 v_ArrVal_10479) .cse2 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10478))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10477) .cse7 v_ArrVal_10479) (select (select (store .cse8 .cse7 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10482))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-12-02 16:59:12,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10574))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10478))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10480))) (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~mem34#1.base| v_ArrVal_10573) .cse0 v_ArrVal_10477) .cse1 v_ArrVal_10479) .cse2 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10574))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10478))) (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~mem34#1.base| v_ArrVal_10573) .cse8 v_ArrVal_10477) .cse9 v_ArrVal_10479) (select (select (store .cse10 .cse9 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10482))))) |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 16:59:12,688 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:59:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878347819] [2023-12-02 16:59:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878347819] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:59:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1928371628] [2023-12-02 16:59:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:59:12,689 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:59:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:59:12,690 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:59:12,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2023-12-02 17:04:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:04:35,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 17:04:35,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:04:35,558 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 17:04:36,907 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:04:36,907 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 17:04:36,936 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 17:04:36,969 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 17:04:37,039 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 17:04:37,242 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 17:04:37,257 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 17:04:40,031 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:04:40,031 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 17:04:40,048 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 17:04:40,354 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:04:40,354 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 17:04:40,371 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 17:04:40,598 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:04:40,598 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 17:04:40,614 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 17:04:40,870 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:04:40,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 17:04:40,886 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 17:04:40,957 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 17:04:40,973 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 17:04:40,988 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 17:04:40,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:04:41,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11061 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11060) |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~mem38#1.base| v_ArrVal_11061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:04:41,213 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_11060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11061 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 17:04:41,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11059) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11061 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11058))) (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~mem37#1.base| v_ArrVal_11059) .cse2 v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 17:04:41,724 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_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11061 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11058))) (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_11059) .cse1 v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11059) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 17:04:42,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11056))) (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~mem36#1.base| v_ArrVal_11057) .cse1 v_ArrVal_11059) (select (select (store .cse2 .cse1 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11060))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11061 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11056))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11058))) (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~mem36#1.base| v_ArrVal_11057) .cse4 v_ArrVal_11059) .cse5 v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 17:04:44,299 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_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11056))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11057) .cse2 v_ArrVal_11059) (select (select (store .cse3 .cse2 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11060))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11061 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11056))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11058))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11057) .cse5 v_ArrVal_11059) .cse6 v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_11061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 17:04:49,507 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11061 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11153))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11056))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11058))) (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~mem34#1.base| v_ArrVal_11152) .cse0 v_ArrVal_11057) .cse1 v_ArrVal_11059) .cse2 v_ArrVal_11060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11153))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11056))) (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~mem34#1.base| v_ArrVal_11152) .cse8 v_ArrVal_11057) .cse9 v_ArrVal_11059) (select (select (store .cse10 .cse9 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11060))))) |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 17:04:49,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1928371628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:04:49,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391182689] [2023-12-02 17:04:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:04:49,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:04:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:04:49,555 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:04:49,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb849411-ab0c-469f-a7f5-a051ff87f381/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-12-02 17:04:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:04:50,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 17:04:50,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:04:51,752 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 17:04:51,875 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:04:51,875 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 17:04:52,236 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 17:04:52,284 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 17:04:53,268 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 17:04:53,292 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 17:04:57,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:04:57,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 62 treesize of output 57 [2023-12-02 17:04:57,743 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 17:04:58,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:04:58,722 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 17:04:58,747 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 17:04:59,440 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:04:59,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 17:04:59,512 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 17:05:00,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:05:00,156 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 17:05:00,183 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 17:05:00,306 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 17:05:00,353 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 17:05:00,355 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 17:05:00,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:05:00,561 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11639) |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~mem38#1.base| v_ArrVal_11638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 17:05:00,672 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_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11639) |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 17:05:00,872 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11636))) (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~mem37#1.base| v_ArrVal_11637) .cse0 v_ArrVal_11639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11637) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11639) |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 17:05:01,263 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_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11636))) (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_11637) .cse1 v_ArrVal_11639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11637) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 17:05:02,497 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11635))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11636))) (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~mem36#1.base| v_ArrVal_11634) .cse0 v_ArrVal_11637) .cse1 v_ArrVal_11639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11635))) (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~mem36#1.base| v_ArrVal_11634) .cse6 v_ArrVal_11637) (select (select (store .cse7 .cse6 v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11639))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false