./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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_0fe1efb9-962a-4794-b868-de4a53d7740d/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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:34:02,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:34:02,953 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 15:34:02,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:34:02,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:34:02,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:34:02,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:34:02,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:34:02,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:34:02,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:34:02,988 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:34:02,989 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:34:02,990 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:34:02,990 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:34:02,991 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:34:02,992 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:34:02,992 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:34:02,993 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:34:02,993 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:34:02,994 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:34:02,995 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:34:02,995 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:34:02,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:34:02,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:34:02,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:34:02,998 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:34:02,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:34:02,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:34:03,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:34:03,000 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:34:03,001 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:34:03,001 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:34:03,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:34:03,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:34:03,002 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:34:03,002 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:34:03,002 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:34:03,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:34:03,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:34:03,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:34:03,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:34:03,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:34:03,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:34:03,004 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:34:03,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:34:03,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:34:03,005 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:34:03,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:34:03,005 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_0fe1efb9-962a-4794-b868-de4a53d7740d/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_0fe1efb9-962a-4794-b868-de4a53d7740d/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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2023-12-02 15:34:03,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:34:03,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:34:03,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:34:03,295 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:34:03,295 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:34:03,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i [2023-12-02 15:34:06,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:34:06,498 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:34:06,499 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i [2023-12-02 15:34:06,517 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data/9e47bc678/ffe1ef3fdea94d929caa24506a7ea6a8/FLAG5e029c555 [2023-12-02 15:34:06,529 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data/9e47bc678/ffe1ef3fdea94d929caa24506a7ea6a8 [2023-12-02 15:34:06,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:34:06,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:34:06,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:34:06,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:34:06,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:34:06,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:06" (1/1) ... [2023-12-02 15:34:06,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cafe217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:06, skipping insertion in model container [2023-12-02 15:34:06,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:06" (1/1) ... [2023-12-02 15:34:06,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:34:07,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:34:07,070 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 15:34:07,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1573086f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:07, skipping insertion in model container [2023-12-02 15:34:07,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:34:07,072 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 15:34:07,074 INFO L158 Benchmark]: Toolchain (without parser) took 539.03ms. Allocated memory is still 157.3MB. Free memory was 112.0MB in the beginning and 91.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 15:34:07,074 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:34:07,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.64ms. Allocated memory is still 157.3MB. Free memory was 111.5MB in the beginning and 91.6MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 15:34:07,077 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.21ms. Allocated memory is still 157.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.64ms. Allocated memory is still 157.3MB. Free memory was 111.5MB in the beginning and 91.6MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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_0fe1efb9-962a-4794-b868-de4a53d7740d/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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:34:08,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:34:08,991 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 15:34:08,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:34:08,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:34:09,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:34:09,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:34:09,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:34:09,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:34:09,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:34:09,028 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:34:09,028 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:34:09,029 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:34:09,029 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:34:09,030 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:34:09,030 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:34:09,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:34:09,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:34:09,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:34:09,032 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:34:09,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:34:09,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:34:09,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:34:09,035 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:34:09,035 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:34:09,036 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:34:09,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:34:09,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:34:09,037 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:34:09,038 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:34:09,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:34:09,039 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:34:09,039 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:34:09,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:34:09,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:34:09,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:34:09,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:34:09,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:34:09,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:34:09,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:34:09,041 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:34:09,041 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:34:09,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:34:09,042 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:34:09,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:34:09,042 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_0fe1efb9-962a-4794-b868-de4a53d7740d/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_0fe1efb9-962a-4794-b868-de4a53d7740d/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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2023-12-02 15:34:09,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:34:09,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:34:09,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:34:09,358 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:34:09,359 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:34:09,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i [2023-12-02 15:34:12,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:34:12,505 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:34:12,505 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i [2023-12-02 15:34:12,523 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data/80fcc86c8/9e98e7b458aa4f6b9908df8f3d9a5cb8/FLAG8865dcb05 [2023-12-02 15:34:12,538 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/data/80fcc86c8/9e98e7b458aa4f6b9908df8f3d9a5cb8 [2023-12-02 15:34:12,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:34:12,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:34:12,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:34:12,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:34:12,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:34:12,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:12" (1/1) ... [2023-12-02 15:34:12,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baa715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:12, skipping insertion in model container [2023-12-02 15:34:12,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:12" (1/1) ... [2023-12-02 15:34:12,619 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:34:13,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:34:13,172 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 15:34:13,188 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:34:13,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:34:13,275 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:34:13,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:34:13,401 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:34:13,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13 WrapperNode [2023-12-02 15:34:13,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:34:13,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:34:13,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:34:13,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:34:13,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,505 INFO L138 Inliner]: procedures = 180, calls = 340, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1135 [2023-12-02 15:34:13,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:34:13,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:34:13,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:34:13,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:34:13,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:34:13,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:34:13,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:34:13,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:34:13,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (1/1) ... [2023-12-02 15:34:13,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:34:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:34:13,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:34:13,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:34:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 15:34:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 15:34:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 15:34:13,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 15:34:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:34:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:34:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:34:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:34:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:34:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:34:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:34:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:34:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:34:13,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:34:13,925 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:34:13,927 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:34:13,931 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 15:34:19,055 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:34:19,233 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:34:19,233 INFO L309 CfgBuilder]: Removed 60 assume(true) statements. [2023-12-02 15:34:19,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:19 BoogieIcfgContainer [2023-12-02 15:34:19,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:34:19,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:34:19,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:34:19,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:34:19,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:34:12" (1/3) ... [2023-12-02 15:34:19,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369b89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:19, skipping insertion in model container [2023-12-02 15:34:19,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:13" (2/3) ... [2023-12-02 15:34:19,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369b89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:19, skipping insertion in model container [2023-12-02 15:34:19,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:19" (3/3) ... [2023-12-02 15:34:19,243 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-1.i [2023-12-02 15:34:19,264 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:34:19,264 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2023-12-02 15:34:19,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:34:19,344 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;@54c616fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:34:19,344 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2023-12-02 15:34:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 1137 states, 487 states have (on average 2.564681724845996) internal successors, (1249), 1129 states have internal predecessors, (1249), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:34:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 15:34:19,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:19,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 15:34:19,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr647ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:19,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1818566, now seen corresponding path program 1 times [2023-12-02 15:34:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521177965] [2023-12-02 15:34:19,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:19,375 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 15:34:19,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:19,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:19,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:19,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:34:19,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:19,580 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 15:34:19,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:19,581 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521177965] [2023-12-02 15:34:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521177965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:19,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:19,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:34:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240344688] [2023-12-02 15:34:19,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:19,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:34:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:34:19,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:34:19,619 INFO L87 Difference]: Start difference. First operand has 1137 states, 487 states have (on average 2.564681724845996) internal successors, (1249), 1129 states have internal predecessors, (1249), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:21,968 INFO L93 Difference]: Finished difference Result 1139 states and 1197 transitions. [2023-12-02 15:34:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:34:21,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-12-02 15:34:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:21,989 INFO L225 Difference]: With dead ends: 1139 [2023-12-02 15:34:21,989 INFO L226 Difference]: Without dead ends: 1136 [2023-12-02 15:34:21,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:34:21,993 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 24 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:21,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1575 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 15:34:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-12-02 15:34:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1127. [2023-12-02 15:34:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 488 states have (on average 2.4139344262295084) internal successors, (1178), 1119 states have internal predecessors, (1178), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:34:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1190 transitions. [2023-12-02 15:34:22,087 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1190 transitions. Word has length 3 [2023-12-02 15:34:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:22,087 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1190 transitions. [2023-12-02 15:34:22,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1190 transitions. [2023-12-02 15:34:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:34:22,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:22,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:34:22,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:22,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:22,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:22,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:22,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1745955341, now seen corresponding path program 1 times [2023-12-02 15:34:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379700162] [2023-12-02 15:34:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:22,291 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 15:34:22,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:22,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:22,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:22,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:34:22,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:22,473 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 15:34:22,484 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 15:34:22,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:22,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379700162] [2023-12-02 15:34:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379700162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:22,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:34:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993990704] [2023-12-02 15:34:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:22,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:34:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:34:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:34:22,488 INFO L87 Difference]: Start difference. First operand 1127 states and 1190 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:24,900 INFO L93 Difference]: Finished difference Result 1157 states and 1231 transitions. [2023-12-02 15:34:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:34:24,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 15:34:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:24,906 INFO L225 Difference]: With dead ends: 1157 [2023-12-02 15:34:24,906 INFO L226 Difference]: Without dead ends: 1157 [2023-12-02 15:34:24,906 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 15:34:24,907 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 1029 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:24,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 533 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 15:34:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2023-12-02 15:34:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1100. [2023-12-02 15:34:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 554 states have (on average 2.1805054151624548) internal successors, (1208), 1092 states have internal predecessors, (1208), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:34:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1220 transitions. [2023-12-02 15:34:24,930 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1220 transitions. Word has length 5 [2023-12-02 15:34:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:24,931 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1220 transitions. [2023-12-02 15:34:24,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1220 transitions. [2023-12-02 15:34:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:34:24,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:24,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:34:24,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:25,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:25,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:25,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1745955342, now seen corresponding path program 1 times [2023-12-02 15:34:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:25,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90998963] [2023-12-02 15:34:25,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:25,135 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 15:34:25,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:25,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:25,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:25,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:34:25,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:25,275 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 15:34:25,296 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 15:34:25,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:25,297 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90998963] [2023-12-02 15:34:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90998963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:25,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:34:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547701556] [2023-12-02 15:34:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:25,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:34:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:25,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:34:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:34:25,300 INFO L87 Difference]: Start difference. First operand 1100 states and 1220 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:29,012 INFO L93 Difference]: Finished difference Result 1372 states and 1512 transitions. [2023-12-02 15:34:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:34:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 15:34:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:29,018 INFO L225 Difference]: With dead ends: 1372 [2023-12-02 15:34:29,018 INFO L226 Difference]: Without dead ends: 1372 [2023-12-02 15:34:29,019 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 15:34:29,020 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 456 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:29,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1123 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-02 15:34:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2023-12-02 15:34:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1223. [2023-12-02 15:34:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 687 states have (on average 2.155749636098981) internal successors, (1481), 1215 states have internal predecessors, (1481), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:34:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1493 transitions. [2023-12-02 15:34:29,043 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1493 transitions. Word has length 5 [2023-12-02 15:34:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:29,043 INFO L495 AbstractCegarLoop]: Abstraction has 1223 states and 1493 transitions. [2023-12-02 15:34:29,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1493 transitions. [2023-12-02 15:34:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:34:29,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:29,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:34:29,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:29,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:29,245 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:29,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1708268006, now seen corresponding path program 1 times [2023-12-02 15:34:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:29,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22279329] [2023-12-02 15:34:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:29,246 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 15:34:29,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:29,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:29,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:29,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:34:29,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:29,371 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 15:34:29,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:29,372 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22279329] [2023-12-02 15:34:29,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22279329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:29,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:29,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:34:29,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458340238] [2023-12-02 15:34:29,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:29,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:34:29,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:34:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:34:29,375 INFO L87 Difference]: Start difference. First operand 1223 states and 1493 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 15:34:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:31,871 INFO L93 Difference]: Finished difference Result 1979 states and 2434 transitions. [2023-12-02 15:34:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:34:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-12-02 15:34:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:31,884 INFO L225 Difference]: With dead ends: 1979 [2023-12-02 15:34:31,884 INFO L226 Difference]: Without dead ends: 1977 [2023-12-02 15:34:31,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 15:34:31,886 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 699 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:31,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 2558 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 15:34:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-12-02 15:34:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1667. [2023-12-02 15:34:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1131 states have (on average 2.1343943412908932) internal successors, (2414), 1656 states have internal predecessors, (2414), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2432 transitions. [2023-12-02 15:34:31,939 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2432 transitions. Word has length 6 [2023-12-02 15:34:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:31,940 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 2432 transitions. [2023-12-02 15:34:31,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 15:34:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2432 transitions. [2023-12-02 15:34:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:34:31,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:31,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:34:31,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:32,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:32,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:32,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -735995369, now seen corresponding path program 1 times [2023-12-02 15:34:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373985706] [2023-12-02 15:34:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:32,143 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 15:34:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:32,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:32,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:32,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:34:32,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:32,337 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 15:34:32,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:32,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:32,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373985706] [2023-12-02 15:34:32,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373985706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:32,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:32,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:34:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833842435] [2023-12-02 15:34:32,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:32,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:34:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:34:32,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:34:32,339 INFO L87 Difference]: Start difference. First operand 1667 states and 2432 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 15:34:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:33,350 INFO L93 Difference]: Finished difference Result 1613 states and 2352 transitions. [2023-12-02 15:34:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:34:33,353 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 15:34:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:33,362 INFO L225 Difference]: With dead ends: 1613 [2023-12-02 15:34:33,362 INFO L226 Difference]: Without dead ends: 1613 [2023-12-02 15:34:33,362 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 15:34:33,363 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 70 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:33,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1741 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 15:34:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2023-12-02 15:34:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2023-12-02 15:34:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1101 states have (on average 2.119891008174387) internal successors, (2334), 1602 states have internal predecessors, (2334), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2352 transitions. [2023-12-02 15:34:33,400 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2352 transitions. Word has length 11 [2023-12-02 15:34:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:33,400 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 2352 transitions. [2023-12-02 15:34:33,400 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 15:34:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2352 transitions. [2023-12-02 15:34:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 15:34:33,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:33,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:34:33,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-02 15:34:33,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:33,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:33,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1378050225, now seen corresponding path program 1 times [2023-12-02 15:34:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644088553] [2023-12-02 15:34:33,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:33,605 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 15:34:33,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:33,606 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:33,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:33,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:34:33,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:33,756 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 15:34:33,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:33,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:33,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644088553] [2023-12-02 15:34:33,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644088553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:34:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117810004] [2023-12-02 15:34:33,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:33,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:34:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:34:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:34:33,758 INFO L87 Difference]: Start difference. First operand 1613 states and 2352 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 15:34:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:35,214 INFO L93 Difference]: Finished difference Result 1599 states and 2310 transitions. [2023-12-02 15:34:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:34:35,216 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 15:34:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:35,224 INFO L225 Difference]: With dead ends: 1599 [2023-12-02 15:34:35,224 INFO L226 Difference]: Without dead ends: 1599 [2023-12-02 15:34:35,224 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 15:34:35,225 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 58 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:35,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2568 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 15:34:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2023-12-02 15:34:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1597. [2023-12-02 15:34:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1099 states have (on average 2.083712465878071) internal successors, (2290), 1586 states have internal predecessors, (2290), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2308 transitions. [2023-12-02 15:34:35,263 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2308 transitions. Word has length 13 [2023-12-02 15:34:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:35,263 INFO L495 AbstractCegarLoop]: Abstraction has 1597 states and 2308 transitions. [2023-12-02 15:34:35,263 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 15:34:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2308 transitions. [2023-12-02 15:34:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:34:35,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:35,265 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 15:34:35,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:35,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:35,468 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:35,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 291695839, now seen corresponding path program 1 times [2023-12-02 15:34:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244439248] [2023-12-02 15:34:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:35,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 15:34:35,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:35,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:35,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:35,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:34:35,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:35,642 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 15:34:35,714 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 15:34:35,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:35,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244439248] [2023-12-02 15:34:35,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244439248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:35,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:35,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:34:35,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356362286] [2023-12-02 15:34:35,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:35,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:34:35,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:35,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:34:35,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:34:35,717 INFO L87 Difference]: Start difference. First operand 1597 states and 2308 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 15:34:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:38,707 INFO L93 Difference]: Finished difference Result 1650 states and 2311 transitions. [2023-12-02 15:34:38,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:34:38,707 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 15:34:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:38,715 INFO L225 Difference]: With dead ends: 1650 [2023-12-02 15:34:38,716 INFO L226 Difference]: Without dead ends: 1650 [2023-12-02 15:34:38,716 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 15:34:38,717 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 964 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:38,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 853 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 15:34:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2023-12-02 15:34:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1593. [2023-12-02 15:34:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1099 states have (on average 2.0764331210191083) internal successors, (2282), 1582 states have internal predecessors, (2282), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2300 transitions. [2023-12-02 15:34:38,754 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2300 transitions. Word has length 27 [2023-12-02 15:34:38,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:38,755 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2300 transitions. [2023-12-02 15:34:38,755 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 15:34:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2300 transitions. [2023-12-02 15:34:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:34:38,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:38,756 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 15:34:38,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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)] Ended with exit code 0 [2023-12-02 15:34:38,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:38,956 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:38,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 291695840, now seen corresponding path program 1 times [2023-12-02 15:34:38,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:38,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167750828] [2023-12-02 15:34:38,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:38,957 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 15:34:38,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:38,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:38,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:39,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:34:39,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:39,101 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 15:34:39,267 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 15:34:39,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:39,267 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167750828] [2023-12-02 15:34:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167750828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:39,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:34:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358161914] [2023-12-02 15:34:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:39,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:34:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:39,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:34:39,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:34:39,269 INFO L87 Difference]: Start difference. First operand 1593 states and 2300 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 15:34:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:43,267 INFO L93 Difference]: Finished difference Result 1739 states and 2312 transitions. [2023-12-02 15:34:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:34:43,268 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 15:34:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:43,274 INFO L225 Difference]: With dead ends: 1739 [2023-12-02 15:34:43,274 INFO L226 Difference]: Without dead ends: 1739 [2023-12-02 15:34:43,275 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 15:34:43,275 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 393 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:43,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1563 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 15:34:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-12-02 15:34:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1589. [2023-12-02 15:34:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1099 states have (on average 2.0691537761601455) internal successors, (2274), 1578 states have internal predecessors, (2274), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2292 transitions. [2023-12-02 15:34:43,309 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2292 transitions. Word has length 27 [2023-12-02 15:34:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:43,310 INFO L495 AbstractCegarLoop]: Abstraction has 1589 states and 2292 transitions. [2023-12-02 15:34:43,310 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 15:34:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2292 transitions. [2023-12-02 15:34:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 15:34:43,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:43,312 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 15:34:43,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:43,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:43,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:43,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash 70830169, now seen corresponding path program 1 times [2023-12-02 15:34:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:43,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246857187] [2023-12-02 15:34:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:43,514 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 15:34:43,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:43,515 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:43,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:43,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:34:43,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:43,746 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 15:34:43,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:43,747 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246857187] [2023-12-02 15:34:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246857187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:43,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:43,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:34:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812762080] [2023-12-02 15:34:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:34:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:34:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:34:43,750 INFO L87 Difference]: Start difference. First operand 1589 states and 2292 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 15:34:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:45,266 INFO L93 Difference]: Finished difference Result 1577 states and 2272 transitions. [2023-12-02 15:34:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:34:45,268 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 15:34:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:45,276 INFO L225 Difference]: With dead ends: 1577 [2023-12-02 15:34:45,276 INFO L226 Difference]: Without dead ends: 1577 [2023-12-02 15:34:45,276 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 15:34:45,277 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 23 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:45,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2554 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 15:34:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2023-12-02 15:34:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2023-12-02 15:34:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1087 states have (on average 2.0735970561177552) internal successors, (2254), 1566 states have internal predecessors, (2254), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2272 transitions. [2023-12-02 15:34:45,316 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2272 transitions. Word has length 43 [2023-12-02 15:34:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:45,317 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2272 transitions. [2023-12-02 15:34:45,317 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 15:34:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2272 transitions. [2023-12-02 15:34:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 15:34:45,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:45,319 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 15:34:45,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:45,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:45,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:45,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1391729543, now seen corresponding path program 1 times [2023-12-02 15:34:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980040713] [2023-12-02 15:34:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:45,522 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 15:34:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:45,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:45,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:45,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:34:45,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:45,960 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 15:34:45,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:45,960 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980040713] [2023-12-02 15:34:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980040713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:34:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390106216] [2023-12-02 15:34:45,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:45,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:34:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:45,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:34:45,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:34:45,962 INFO L87 Difference]: Start difference. First operand 1577 states and 2272 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 15:34:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:46,878 INFO L93 Difference]: Finished difference Result 1469 states and 2048 transitions. [2023-12-02 15:34:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:34:46,880 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 15:34:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:46,888 INFO L225 Difference]: With dead ends: 1469 [2023-12-02 15:34:46,888 INFO L226 Difference]: Without dead ends: 1469 [2023-12-02 15:34:46,888 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 15:34:46,889 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 59 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:46,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1667 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 15:34:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2023-12-02 15:34:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2023-12-02 15:34:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 979 states have (on average 2.073544433094995) internal successors, (2030), 1458 states have internal predecessors, (2030), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2048 transitions. [2023-12-02 15:34:46,916 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2048 transitions. Word has length 47 [2023-12-02 15:34:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:46,916 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 2048 transitions. [2023-12-02 15:34:46,916 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 15:34:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2048 transitions. [2023-12-02 15:34:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 15:34:46,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:46,918 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 15:34:46,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:47,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:47,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:47,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1802984030, now seen corresponding path program 1 times [2023-12-02 15:34:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794024485] [2023-12-02 15:34:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:47,123 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 15:34:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:47,124 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:47,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:47,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:34:47,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:47,466 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 15:34:47,473 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 15:34:48,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:34:48,021 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 15:34:48,043 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:34:48,044 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 15:34:48,065 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 15:34:48,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:48,066 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:48,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794024485] [2023-12-02 15:34:48,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794024485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:48,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:48,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:34:48,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975273478] [2023-12-02 15:34:48,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:48,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:34:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:48,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:34:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:34:48,068 INFO L87 Difference]: Start difference. First operand 1469 states and 2048 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 15:34:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:50,889 INFO L93 Difference]: Finished difference Result 1441 states and 1932 transitions. [2023-12-02 15:34:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:34:50,890 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 15:34:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:50,898 INFO L225 Difference]: With dead ends: 1441 [2023-12-02 15:34:50,898 INFO L226 Difference]: Without dead ends: 1441 [2023-12-02 15:34:50,898 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 15:34:50,899 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 943 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:50,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 290 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 15:34:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2023-12-02 15:34:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1252. [2023-12-02 15:34:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 846 states have (on average 1.9148936170212767) internal successors, (1620), 1241 states have internal predecessors, (1620), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1638 transitions. [2023-12-02 15:34:50,921 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1638 transitions. Word has length 50 [2023-12-02 15:34:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:50,922 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1638 transitions. [2023-12-02 15:34:50,922 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 15:34:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1638 transitions. [2023-12-02 15:34:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 15:34:50,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:50,923 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 15:34:50,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:34:51,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:51,130 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:51,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2028466261, now seen corresponding path program 1 times [2023-12-02 15:34:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:51,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736830280] [2023-12-02 15:34:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:51,131 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 15:34:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:51,132 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:51,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:51,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:34:51,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:51,360 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 15:34:51,380 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 15:34:51,404 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 15:34:51,417 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 15:34:51,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:51,418 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:51,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736830280] [2023-12-02 15:34:51,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736830280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:51,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:34:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784309441] [2023-12-02 15:34:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:51,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:34:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:34:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:34:51,421 INFO L87 Difference]: Start difference. First operand 1252 states and 1638 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 15:34:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:54,976 INFO L93 Difference]: Finished difference Result 1251 states and 1636 transitions. [2023-12-02 15:34:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:34:54,977 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 15:34:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:54,984 INFO L225 Difference]: With dead ends: 1251 [2023-12-02 15:34:54,984 INFO L226 Difference]: Without dead ends: 1251 [2023-12-02 15:34:54,984 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 15:34:54,985 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 3 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:54,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1963 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-02 15:34:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-12-02 15:34:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2023-12-02 15:34:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 846 states have (on average 1.9125295508274232) internal successors, (1618), 1240 states have internal predecessors, (1618), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:34:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1636 transitions. [2023-12-02 15:34:55,003 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1636 transitions. Word has length 54 [2023-12-02 15:34:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:55,003 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1636 transitions. [2023-12-02 15:34:55,004 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 15:34:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1636 transitions. [2023-12-02 15:34:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 15:34:55,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:55,005 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 15:34:55,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:55,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:34:55,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2028466260, now seen corresponding path program 1 times [2023-12-02 15:34:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128213255] [2023-12-02 15:34:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:55,206 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 15:34:55,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:55,207 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:55,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:34:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:55,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 15:34:55,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:55,436 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 15:34:55,453 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 15:34:55,462 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 15:34:55,499 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 15:34:55,519 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 15:34:55,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:34:55,519 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:55,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128213255] [2023-12-02 15:34:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128213255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:55,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:55,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:34:55,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45976899] [2023-12-02 15:34:55,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:55,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:34:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:55,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:34:55,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:34:55,521 INFO L87 Difference]: Start difference. First operand 1251 states and 1636 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 15:35:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:00,142 INFO L93 Difference]: Finished difference Result 1250 states and 1634 transitions. [2023-12-02 15:35:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:35:00,144 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 15:35:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:00,150 INFO L225 Difference]: With dead ends: 1250 [2023-12-02 15:35:00,150 INFO L226 Difference]: Without dead ends: 1250 [2023-12-02 15:35:00,150 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 15:35:00,151 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 1 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:00,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1986 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-02 15:35:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-12-02 15:35:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-12-02 15:35:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 844 states have (on average 1.914691943127962) internal successors, (1616), 1239 states have internal predecessors, (1616), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-02 15:35:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1634 transitions. [2023-12-02 15:35:00,167 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1634 transitions. Word has length 54 [2023-12-02 15:35:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:00,167 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1634 transitions. [2023-12-02 15:35:00,167 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 15:35:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1634 transitions. [2023-12-02 15:35:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 15:35:00,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:00,168 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 15:35:00,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:00,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:00,369 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:35:00,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1249065009, now seen corresponding path program 1 times [2023-12-02 15:35:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275768808] [2023-12-02 15:35:00,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:00,370 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 15:35:00,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:00,371 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:00,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:00,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:35:00,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:00,643 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 15:35:00,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:35:00,643 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275768808] [2023-12-02 15:35:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275768808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:35:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:35:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:35:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633843135] [2023-12-02 15:35:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:35:00,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:35:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:35:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:35:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:35:00,645 INFO L87 Difference]: Start difference. First operand 1250 states and 1634 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 15:35:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:02,016 INFO L93 Difference]: Finished difference Result 1252 states and 1639 transitions. [2023-12-02 15:35:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:35:02,018 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 15:35:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:02,028 INFO L225 Difference]: With dead ends: 1252 [2023-12-02 15:35:02,028 INFO L226 Difference]: Without dead ends: 1252 [2023-12-02 15:35:02,028 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 15:35:02,029 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 1 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:02,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2349 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 15:35:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2023-12-02 15:35:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2023-12-02 15:35:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 845 states have (on average 1.9147928994082841) internal successors, (1618), 1241 states have internal predecessors, (1618), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 15:35:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1639 transitions. [2023-12-02 15:35:02,058 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1639 transitions. Word has length 60 [2023-12-02 15:35:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:02,058 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1639 transitions. [2023-12-02 15:35:02,058 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 15:35:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1639 transitions. [2023-12-02 15:35:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 15:35:02,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:02,059 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 15:35:02,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:02,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:02,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:35:02,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1386880438, now seen corresponding path program 1 times [2023-12-02 15:35:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:02,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928462667] [2023-12-02 15:35:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:02,261 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 15:35:02,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:02,261 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:02,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:02,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:35:02,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:02,528 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 15:35:02,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:02,601 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 15:35:02,601 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928462667] [2023-12-02 15:35:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928462667] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [190195934] [2023-12-02 15:35:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:02,602 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:35:02,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:35:02,603 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:35:02,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-02 15:35:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:03,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:35:03,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:03,033 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 15:35:03,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:03,065 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 15:35:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [190195934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:03,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420834267] [2023-12-02 15:35:03,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:03,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:03,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:35:03,066 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:35:03,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 15:35:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:03,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:35:03,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:03,365 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 15:35:03,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:03,397 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 15:35:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420834267] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:03,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:35:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 15:35:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601649357] [2023-12-02 15:35:03,398 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:35:03,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:35:03,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:35:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:35:03,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:35:03,400 INFO L87 Difference]: Start difference. First operand 1252 states and 1639 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 15:35:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:06,152 INFO L93 Difference]: Finished difference Result 1261 states and 1655 transitions. [2023-12-02 15:35:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:35:06,153 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 15:35:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:06,158 INFO L225 Difference]: With dead ends: 1261 [2023-12-02 15:35:06,158 INFO L226 Difference]: Without dead ends: 1261 [2023-12-02 15:35:06,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:35:06,159 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 6 mSDsluCounter, 4674 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:06,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5457 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 15:35:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2023-12-02 15:35:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1260. [2023-12-02 15:35:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 852 states have (on average 1.914319248826291) internal successors, (1631), 1248 states have internal predecessors, (1631), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 15:35:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1652 transitions. [2023-12-02 15:35:06,175 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1652 transitions. Word has length 61 [2023-12-02 15:35:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:06,175 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1652 transitions. [2023-12-02 15:35:06,176 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 15:35:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1652 transitions. [2023-12-02 15:35:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 15:35:06,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:06,176 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 15:35:06,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-02 15:35:06,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 15:35:06,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:06,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:06,777 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:35:06,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1121547889, now seen corresponding path program 2 times [2023-12-02 15:35:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358381930] [2023-12-02 15:35:06,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:35:06,779 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 15:35:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:06,780 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:06,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:07,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:35:07,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:07,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:35:07,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:07,202 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 15:35:07,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:07,342 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 15:35:07,342 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358381930] [2023-12-02 15:35:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358381930] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1200884641] [2023-12-02 15:35:07,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:35:07,342 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:35:07,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:35:07,343 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:35:07,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 15:35:08,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:35:08,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:08,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:35:08,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:08,518 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 15:35:08,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:08,567 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 15:35:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1200884641] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547097249] [2023-12-02 15:35:08,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:35:08,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:08,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:35:08,568 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:35:08,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 15:35:24,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:35:24,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:24,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:35:24,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:24,163 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:35:24,163 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 15:35:24,201 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 15:35:24,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:35:24,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:35:24,624 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 15:35:24,667 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 15:35:24,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:24,802 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 15:35:24,802 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 15:35:24,815 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 15:35:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547097249] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:35:24,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 15:35:24,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 15:35:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613862011] [2023-12-02 15:35:24,819 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 15:35:24,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 15:35:24,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:35:24,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 15:35:24,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2023-12-02 15:35:24,822 INFO L87 Difference]: Start difference. First operand 1260 states and 1652 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 15:35:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:39,825 INFO L93 Difference]: Finished difference Result 1330 states and 1691 transitions. [2023-12-02 15:35:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 15:35:39,826 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 15:35:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:39,835 INFO L225 Difference]: With dead ends: 1330 [2023-12-02 15:35:39,835 INFO L226 Difference]: Without dead ends: 1328 [2023-12-02 15:35:39,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=2410, Unknown=1, NotChecked=104, Total=2970 [2023-12-02 15:35:39,837 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 865 mSDsluCounter, 4682 mSDsCounter, 0 mSdLazyCounter, 7106 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 5074 SdHoareTripleChecker+Invalid, 7160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 7106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:39,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 5074 Invalid, 7160 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 7106 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2023-12-02 15:35:39,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2023-12-02 15:35:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1268. [2023-12-02 15:35:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 861 states have (on average 1.9059233449477353) internal successors, (1641), 1256 states have internal predecessors, (1641), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 15:35:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1662 transitions. [2023-12-02 15:35:39,857 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1662 transitions. Word has length 64 [2023-12-02 15:35:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:39,857 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1662 transitions. [2023-12-02 15:35:39,857 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 15:35:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1662 transitions. [2023-12-02 15:35:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 15:35:39,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:39,858 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 15:35:39,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 15:35:40,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-02 15:35:40,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-12-02 15:35:40,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:35:40,459 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:35:40,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1368999982, now seen corresponding path program 1 times [2023-12-02 15:35:40,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:40,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815897239] [2023-12-02 15:35:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:40,460 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 15:35:40,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:40,462 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:40,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:40,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:35:40,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:40,970 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 15:35:40,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:41,593 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 15:35:41,594 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815897239] [2023-12-02 15:35:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815897239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [379958058] [2023-12-02 15:35:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:41,594 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:35:41,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:35:41,603 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:35:41,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 15:35:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:42,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:35:42,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:42,259 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 15:35:42,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:42,398 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 15:35:42,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [379958058] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:42,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735124102] [2023-12-02 15:35:42,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:42,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:42,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:35:42,399 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:35:42,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 15:35:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:42,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 15:35:42,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:42,852 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 15:35:42,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:43,776 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 15:35:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735124102] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:43,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:35:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 15:35:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890809188] [2023-12-02 15:35:43,778 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:35:43,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 15:35:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:35:43,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 15:35:43,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 15:35:43,780 INFO L87 Difference]: Start difference. First operand 1268 states and 1662 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 15:35:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:52,857 INFO L93 Difference]: Finished difference Result 1298 states and 1725 transitions. [2023-12-02 15:35:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 15:35:52,858 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 15:35:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:52,864 INFO L225 Difference]: With dead ends: 1298 [2023-12-02 15:35:52,864 INFO L226 Difference]: Without dead ends: 1295 [2023-12-02 15:35:52,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 15:35:52,866 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 24 mSDsluCounter, 10106 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10886 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:52,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10886 Invalid, 2549 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-12-02 15:35:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-12-02 15:35:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1286. [2023-12-02 15:35:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 1274 states have internal predecessors, (1664), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 15:35:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1685 transitions. [2023-12-02 15:35:52,890 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1685 transitions. Word has length 70 [2023-12-02 15:35:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:52,890 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1685 transitions. [2023-12-02 15:35:52,891 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 15:35:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1685 transitions. [2023-12-02 15:35:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-02 15:35:52,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:52,892 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 15:35:52,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-02 15:35:53,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-12-02 15:35:53,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:53,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:53,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:35:53,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash -43277678, now seen corresponding path program 2 times [2023-12-02 15:35:53,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:53,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437573855] [2023-12-02 15:35:53,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:35:53,494 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 15:35:53,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:53,495 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:53,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:35:54,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:35:54,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:54,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 15:35:54,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:54,700 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 15:35:54,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:57,556 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 15:35:57,556 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:57,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437573855] [2023-12-02 15:35:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437573855] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:57,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [685500037] [2023-12-02 15:35:57,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:35:57,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:35:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:35:57,558 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:35:57,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 15:35:59,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:35:59,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:59,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 15:35:59,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:59,272 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 15:35:59,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:59,993 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 15:35:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [685500037] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018920628] [2023-12-02 15:35:59,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:35:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:59,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:35:59,995 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:35:59,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 15:36:12,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:36:12,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:36:12,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 15:36:12,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:12,960 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:36:12,960 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 15:36:12,967 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 15:36:13,070 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 15:36:13,085 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 15:36:13,454 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 15:36:13,459 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 15:36:14,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:36:14,084 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 15:36:14,094 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 15:36:14,286 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 15:36:14,293 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 15:36:14,398 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 15:36:14,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:15,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:36:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018920628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:36:15,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 15:36:15,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 15:36:15,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861083650] [2023-12-02 15:36:15,374 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 15:36:15,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 15:36:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:36:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 15:36:15,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 15:36:15,377 INFO L87 Difference]: Start difference. First operand 1286 states and 1685 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 15:37:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:11,266 INFO L93 Difference]: Finished difference Result 1455 states and 1936 transitions. [2023-12-02 15:37:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-12-02 15:37:11,267 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 15:37:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:11,271 INFO L225 Difference]: With dead ends: 1455 [2023-12-02 15:37:11,271 INFO L226 Difference]: Without dead ends: 1446 [2023-12-02 15:37:11,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7047 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=5889, Invalid=20846, Unknown=1, NotChecked=324, Total=27060 [2023-12-02 15:37:11,279 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 906 mSDsluCounter, 10503 mSDsCounter, 0 mSdLazyCounter, 20255 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 10895 SdHoareTripleChecker+Invalid, 20396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 20255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:11,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 10895 Invalid, 20396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [141 Valid, 20255 Invalid, 0 Unknown, 0 Unchecked, 37.2s Time] [2023-12-02 15:37:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2023-12-02 15:37:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1370. [2023-12-02 15:37:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 963 states have (on average 1.8276220145379023) internal successors, (1760), 1357 states have internal predecessors, (1760), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-02 15:37:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1781 transitions. [2023-12-02 15:37:11,311 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1781 transitions. Word has length 82 [2023-12-02 15:37:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:11,311 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1781 transitions. [2023-12-02 15:37:11,311 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 15:37:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1781 transitions. [2023-12-02 15:37:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 15:37:11,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:11,313 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 15:37:11,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 15:37:11,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-12-02 15:37:11,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:37:11,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:37:11,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:37:11,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 773579426, now seen corresponding path program 1 times [2023-12-02 15:37:11,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:37:11,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318449149] [2023-12-02 15:37:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:11,915 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 15:37:11,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:37:11,916 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:37:11,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:37:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:12,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 15:37:12,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:12,641 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 15:37:12,751 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:37:12,752 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 15:37:12,785 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 15:37:12,867 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 15:37:13,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:37:13,703 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 15:37:13,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:37:13,792 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 15:37:13,802 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 15:37:13,837 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 15:37:13,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:15,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (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_2865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:37:16,358 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2911 (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~mem33#1.base| v_ArrVal_2911))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2865)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:37:16,360 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:37:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318449149] [2023-12-02 15:37:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318449149] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:37:16,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1841289895] [2023-12-02 15:37:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:37:16,362 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:37:16,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 15:37:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:18,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 15:37:18,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:18,345 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:37:18,346 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 15:37:18,752 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:37:18,752 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 15:37:18,823 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 15:37:19,033 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 15:37:20,369 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:37:20,369 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 15:37:20,569 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:37:20,569 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 15:37:20,596 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 15:37:20,671 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 15:37:20,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:20,688 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3318) |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 15:37:20,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3318 (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_3318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:37:21,075 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3364))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3318)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:37:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1841289895] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:37:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80009145] [2023-12-02 15:37:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:21,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:37:21,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:37:21,078 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:37:21,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 15:37:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:21,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 15:37:21,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:21,685 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:37:21,685 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 15:37:21,724 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 15:37:22,349 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:37:22,349 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 15:37:22,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:37:22,521 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 15:37:22,531 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 15:37:22,535 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 15:37:22,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:22,563 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3769) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-12-02 15:37:22,575 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3769 (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_3769) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:37:22,985 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 15:37:22,985 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 15:37:22,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3815))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 15:37:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80009145] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:37:22,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:37:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2023-12-02 15:37:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358474313] [2023-12-02 15:37:22,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:37:22,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 15:37:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:37:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 15:37:23,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=742, Unknown=11, NotChecked=504, Total=1406 [2023-12-02 15:37:23,000 INFO L87 Difference]: Start difference. First operand 1370 states and 1781 transitions. Second operand has 28 states, 24 states have (on average 5.875) internal successors, (141), 27 states have internal predecessors, (141), 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 15:37:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:40,602 INFO L93 Difference]: Finished difference Result 2306 states and 2740 transitions. [2023-12-02 15:37:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 15:37:40,604 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.875) internal successors, (141), 27 states have internal predecessors, (141), 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 15:37:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:40,610 INFO L225 Difference]: With dead ends: 2306 [2023-12-02 15:37:40,610 INFO L226 Difference]: Without dead ends: 2306 [2023-12-02 15:37:40,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=235, Invalid=1346, Unknown=11, NotChecked=664, Total=2256 [2023-12-02 15:37:40,611 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 1529 mSDsluCounter, 6034 mSDsCounter, 0 mSdLazyCounter, 9077 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 6553 SdHoareTripleChecker+Invalid, 9113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 9077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:40,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 6553 Invalid, 9113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 9077 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2023-12-02 15:37:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2023-12-02 15:37:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1776. [2023-12-02 15:37:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1365 states have (on average 1.772161172161172) internal successors, (2419), 1756 states have internal predecessors, (2419), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 15:37:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2454 transitions. [2023-12-02 15:37:40,653 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2454 transitions. Word has length 106 [2023-12-02 15:37:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:40,653 INFO L495 AbstractCegarLoop]: Abstraction has 1776 states and 2454 transitions. [2023-12-02 15:37:40,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.875) internal successors, (141), 27 states have internal predecessors, (141), 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 15:37:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2454 transitions. [2023-12-02 15:37:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 15:37:40,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:40,655 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 15:37:40,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-02 15:37:40,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-12-02 15:37:41,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-12-02 15:37:41,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:41,256 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:37:41,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 773579427, now seen corresponding path program 1 times [2023-12-02 15:37:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:37:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511666189] [2023-12-02 15:37:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:41,257 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 15:37:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:37:41,258 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:37:41,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:37:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:42,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 15:37:42,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:42,050 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 15:37:42,140 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:37:42,140 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 15:37:42,147 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 15:37:42,169 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 15:37:42,177 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 15:37:42,278 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 15:37:42,283 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 15:37:42,916 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:37:42,916 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 15:37:42,922 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 15:37:43,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:37:43,029 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 15:37:43,035 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 15:37:43,054 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 15:37:43,061 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 15:37:43,088 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 15:37:43,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:43,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4268) |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 15:37:43,269 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_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:37:44,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4360))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4359) .cse0 v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4359 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4359) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4360) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-12-02 15:37:44,575 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:37:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511666189] [2023-12-02 15:37:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511666189] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:37:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784148620] [2023-12-02 15:37:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:44,575 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:44,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:37:44,576 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:37:44,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 15:39:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:37,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 15:39:37,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:37,473 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 15:39:37,738 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:39:37,738 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 15:39:37,743 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 15:39:37,790 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 15:39:37,795 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 15:39:37,939 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 15:39:37,943 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 15:39:38,487 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:39:38,487 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 15:39:38,497 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 15:39:38,654 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:39:38,654 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 15:39:38,658 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 15:39:38,677 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 15:39:38,683 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 15:39:38,685 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 15:39:38,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:39:38,730 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:39:38,764 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_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |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 15:39:40,128 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4905))) (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~mem33#1.base| v_ArrVal_4904) .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4904) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4813) |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 15:39:40,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1784148620] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:39:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057037415] [2023-12-02 15:39:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:40,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:39:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:39:40,139 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:39:40,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 15:39:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:40,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 15:39:40,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:40,706 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 15:39:40,803 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 15:39:40,814 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:39:40,814 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 15:39:40,823 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 15:39:40,835 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 15:39:40,877 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 15:39:40,881 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 15:39:41,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:39:41,473 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 15:39:41,482 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 15:39:41,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:39:41,562 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 15:39:41,574 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 15:39:41,587 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 15:39:41,594 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 15:39:41,598 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 15:39:41,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:39:41,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5357) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:39:41,684 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_5357 (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_5357) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:39:42,871 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5450) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5449) |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) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5449))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5450) .cse2 v_ArrVal_5358) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5357) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:39:42,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057037415] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:39:42,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:39:42,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 15:39:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350303247] [2023-12-02 15:39:42,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:39:42,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 15:39:42,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:39:42,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 15:39:42,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=231, Unknown=9, NotChecked=342, Total=650 [2023-12-02 15:39:42,881 INFO L87 Difference]: Start difference. First operand 1776 states and 2454 transitions. Second operand has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 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 15:39:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:56,910 INFO L93 Difference]: Finished difference Result 2129 states and 2774 transitions. [2023-12-02 15:39:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:39:56,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 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 15:39:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:56,916 INFO L225 Difference]: With dead ends: 2129 [2023-12-02 15:39:56,916 INFO L226 Difference]: Without dead ends: 2129 [2023-12-02 15:39:56,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2023-12-02 15:39:56,917 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1113 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 6416 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 6437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:56,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 2202 Invalid, 6437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 6416 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2023-12-02 15:39:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2023-12-02 15:39:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1775. [2023-12-02 15:39:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1365 states have (on average 1.76996336996337) internal successors, (2416), 1755 states have internal predecessors, (2416), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 15:39:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2451 transitions. [2023-12-02 15:39:56,945 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2451 transitions. Word has length 106 [2023-12-02 15:39:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:56,945 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2451 transitions. [2023-12-02 15:39:56,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 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 15:39:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2451 transitions. [2023-12-02 15:39:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 15:39:56,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:56,947 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 15:39:56,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 15:39:57,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:39:57,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 15:39:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:39:57,548 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:39:57,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash 382009965, now seen corresponding path program 1 times [2023-12-02 15:39:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:39:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813315873] [2023-12-02 15:39:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:57,549 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 15:39:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:39:57,550 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:39:57,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:39:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:58,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 15:39:58,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:58,459 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 15:39:58,580 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:39:58,581 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 15:39:58,614 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 15:39:58,692 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 15:39:59,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:39:59,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:39:59,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:39:59,645 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 15:39:59,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:39:59,730 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 15:39:59,742 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 15:39:59,779 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 15:39:59,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:40:00,345 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (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_5873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 15:40:00,358 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5872))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5873)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:40:00,370 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5873 (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_5872))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5873)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:40:00,724 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5919))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5872)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5873)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:40:00,728 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:40:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813315873] [2023-12-02 15:40:00,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813315873] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:40:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [541031208] [2023-12-02 15:40:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:00,728 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:40:00,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:40:00,729 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:40:00,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 15:40:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:26,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 15:40:27,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:27,050 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:40:27,050 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 15:40:27,501 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:40:27,501 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 15:40:27,605 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 15:40:27,787 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 15:40:28,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:40:28,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 15:40:29,184 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:40:29,185 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 15:40:29,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:40:29,293 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 15:40:29,323 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 15:40:29,385 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 15:40:29,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:40:29,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6342 (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_6342) |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 15:40:29,416 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (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_6342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 15:40:29,427 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6342 (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~mem35#1.base| v_ArrVal_6341))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6342)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:40:29,440 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6342 (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_6341))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6342)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:40:29,791 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6388))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6341)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6342)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:40:29,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [541031208] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:40:29,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46444329] [2023-12-02 15:40:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:29,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:40:29,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:40:29,795 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:40:29,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 15:40:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:30,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 15:40:30,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:30,486 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:40:30,487 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 15:40:30,522 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 15:40:30,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:40:30,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:40:30,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:40:30,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:40:31,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:40:31,038 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 15:40:31,103 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 15:40:31,106 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 15:40:31,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:40:31,125 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 15:40:31,125 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 15:40:31,132 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2023-12-02 15:40:31,141 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 15:40:31,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6808)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 15:40:31,161 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6808))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 15:40:31,520 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6855 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6855))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6808)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 15:40:31,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46444329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:40:31,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:40:31,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-12-02 15:40:31,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137692172] [2023-12-02 15:40:31,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:40:31,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 15:40:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:40:31,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 15:40:31,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=846, Unknown=19, NotChecked=1022, Total=2070 [2023-12-02 15:40:31,524 INFO L87 Difference]: Start difference. First operand 1775 states and 2451 transitions. Second operand has 30 states, 26 states have (on average 5.653846153846154) internal successors, (147), 30 states have internal predecessors, (147), 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 15:40:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:40:47,353 INFO L93 Difference]: Finished difference Result 2302 states and 2734 transitions. [2023-12-02 15:40:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 15:40:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.653846153846154) internal successors, (147), 30 states have internal predecessors, (147), 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 15:40:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:40:47,362 INFO L225 Difference]: With dead ends: 2302 [2023-12-02 15:40:47,362 INFO L226 Difference]: Without dead ends: 2302 [2023-12-02 15:40:47,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=1139, Unknown=19, NotChecked=1162, Total=2550 [2023-12-02 15:40:47,364 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 1524 mSDsluCounter, 5524 mSDsCounter, 0 mSdLazyCounter, 8343 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 6043 SdHoareTripleChecker+Invalid, 8387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 8343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:40:47,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 6043 Invalid, 8387 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 8343 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2023-12-02 15:40:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2023-12-02 15:40:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1774. [2023-12-02 15:40:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1365 states have (on average 1.7677655677655677) internal successors, (2413), 1754 states have internal predecessors, (2413), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 15:40:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2448 transitions. [2023-12-02 15:40:47,386 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2448 transitions. Word has length 108 [2023-12-02 15:40:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:40:47,386 INFO L495 AbstractCegarLoop]: Abstraction has 1774 states and 2448 transitions. [2023-12-02 15:40:47,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.653846153846154) internal successors, (147), 30 states have internal predecessors, (147), 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 15:40:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2448 transitions. [2023-12-02 15:40:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 15:40:47,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:40:47,388 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 15:40:47,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 15:40:47,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 15:40:47,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:40:47,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:40:47,989 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:40:47,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:40:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 382009966, now seen corresponding path program 1 times [2023-12-02 15:40:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:40:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510856487] [2023-12-02 15:40:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:47,990 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 15:40:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:40:47,991 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:40:47,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:40:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:49,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 15:40:49,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:49,020 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 15:40:49,131 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 15:40:49,144 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:40:49,144 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 15:40:49,169 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 15:40:49,172 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 15:40:49,253 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 15:40:49,256 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 15:40:49,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:40:49,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 15:40:49,849 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 15:40:49,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:40:49,944 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 15:40:49,955 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 15:40:50,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:40:50,037 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 15:40:50,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 30 treesize of output 13 [2023-12-02 15:40:50,060 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 15:40:50,064 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 15:40:50,094 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 15:40:50,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:40:50,249 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)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7324) |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_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:40:50,283 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_7324 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:40:50,322 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_7322 (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~mem35#1.base| v_ArrVal_7322))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7323) .cse0 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (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~mem35#1.base| v_ArrVal_7323) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7324) |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 15:40:50,373 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_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7322))) (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_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (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_7322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 15:40:52,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7417))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7322))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7416) .cse0 v_ArrVal_7323) .cse1 v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7417))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7416) .cse6 v_ArrVal_7323) (select (select (store .cse7 .cse6 v_ArrVal_7322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7324))) |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 15:40:52,500 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:40:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510856487] [2023-12-02 15:40:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510856487] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:40:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1079699151] [2023-12-02 15:40:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:52,501 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:40:52,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:40:52,502 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:40:52,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 15:41:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:41:56,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 15:41:56,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:41:56,564 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 15:41:57,041 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:41:57,041 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 15:41:57,056 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 15:41:57,134 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 15:41:57,159 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 15:41:57,389 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 15:41:57,396 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 15:41:58,341 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:41:58,341 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 15:41:58,348 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 15:41:58,609 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:41:58,609 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 15:41:58,616 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 15:41:58,785 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:41:58,785 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 15:41:58,791 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 15:41:58,820 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 15:41:58,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 7 treesize of output 3 [2023-12-02 15:41:58,833 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 15:41:58,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:41:58,893 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7887) |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~mem36#1.base| v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7887) |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 15:41:58,932 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_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 15:41:58,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((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_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#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~mem35#1.base| v_ArrVal_7884) .cse0 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7884) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7887) |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 15:41:59,026 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_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7885))) (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_7884) .cse1 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7884) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 15:42:01,187 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_7978 (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_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7978))) (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~mem33#1.base| v_ArrVal_7979) .cse0 v_ArrVal_7884) .cse1 v_ArrVal_7887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7978))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7979) .cse6 v_ArrVal_7884) (select (select (store .cse7 .cse6 v_ArrVal_7885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7887))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 15:42:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1079699151] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:42:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92075153] [2023-12-02 15:42:01,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:42:01,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:42:01,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:42:01,205 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:42:01,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 15:42:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:42:01,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 15:42:01,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:42:01,845 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 15:42:02,048 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 15:42:02,072 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:42:02,073 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 15:42:02,099 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 15:42:02,106 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 15:42:02,183 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 15:42:02,189 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 15:42:03,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:42:03,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 15:42:03,174 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 15:42:03,276 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:42:03,276 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 15:42:03,294 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 15:42:03,365 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:42:03,366 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 15:42:03,384 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 15:42:03,398 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 15:42:03,404 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 15:42:03,413 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 15:42:03,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:42:03,482 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)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (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)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:42:03,521 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 15:42:03,567 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~mem35#1.base| v_ArrVal_8446) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8447) |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 (_ bv12 32) .cse0)))) (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~mem35#1.base| v_ArrVal_8447))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8446) .cse2 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (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 15:42:03,618 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_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| .cse0 v_ArrVal_8447))) (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_8446) .cse1 v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (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 ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8446) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 15:42:05,486 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~mem33#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~mem33#1.base| v_ArrVal_8541) .cse1 v_ArrVal_8446) (select (select (store .cse2 .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8449))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (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~mem33#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_8447))) (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~mem33#1.base| v_ArrVal_8541) .cse4 v_ArrVal_8446) .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 15:42:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92075153] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:42:05,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:42:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 15:42:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408680969] [2023-12-02 15:42:05,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:42:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 15:42:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:42:05,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 15:42:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=297, Unknown=15, NotChecked=720, Total=1122 [2023-12-02 15:42:05,501 INFO L87 Difference]: Start difference. First operand 1774 states and 2448 transitions. Second operand has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 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 15:42:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:42:26,396 INFO L93 Difference]: Finished difference Result 2127 states and 2768 transitions. [2023-12-02 15:42:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:42:26,397 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 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 15:42:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:42:26,400 INFO L225 Difference]: With dead ends: 2127 [2023-12-02 15:42:26,400 INFO L226 Difference]: Without dead ends: 2127 [2023-12-02 15:42:26,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 308 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=143, Invalid=502, Unknown=15, NotChecked=900, Total=1560 [2023-12-02 15:42:26,401 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1585 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 6335 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 6364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:42:26,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 2113 Invalid, 6364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 6335 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2023-12-02 15:42:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2023-12-02 15:42:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1773. [2023-12-02 15:42:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1365 states have (on average 1.7655677655677655) internal successors, (2410), 1753 states have internal predecessors, (2410), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 15:42:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2445 transitions. [2023-12-02 15:42:26,425 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2445 transitions. Word has length 108 [2023-12-02 15:42:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:42:26,425 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2445 transitions. [2023-12-02 15:42:26,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 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 15:42:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2445 transitions. [2023-12-02 15:42:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 15:42:26,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:42:26,427 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 15:42:26,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-12-02 15:42:26,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:42:26,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2023-12-02 15:42:27,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:42:27,027 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:42:27,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:42:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2040875411, now seen corresponding path program 1 times [2023-12-02 15:42:27,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:42:27,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357209747] [2023-12-02 15:42:27,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:42:27,028 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 15:42:27,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:42:27,029 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:42:27,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:42:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:42:28,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 15:42:28,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:42:28,305 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 15:42:28,551 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:42:28,551 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 15:42:28,609 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 15:42:28,733 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 15:42:29,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:42:29,984 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 15:42:30,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:42:30,169 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 15:42:30,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:42:30,323 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 15:42:30,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:42:30,457 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 15:42:30,475 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 15:42:30,540 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 15:42:30,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:42:32,725 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 15:42:32,745 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 (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_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 15:42:32,764 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 15:42:32,786 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| |c_ULTIMATE.start_main_#t~mem35#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))) (_ bv1 1)))) is different from false [2023-12-02 15:42:32,810 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 15:42:33,262 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~mem33#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 15:42:33,266 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:42:33,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357209747] [2023-12-02 15:42:33,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357209747] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:42:33,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [923467734] [2023-12-02 15:42:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:42:33,266 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:42:33,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:42:33,267 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:42:33,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-12-02 15:43:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:43:48,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 15:43:48,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:43:48,765 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:43:48,765 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 15:43:49,553 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:43:49,553 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 15:43:49,681 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 15:43:50,039 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 15:43:52,086 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:43:52,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 41 [2023-12-02 15:43:52,423 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:43:52,423 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 15:43:52,647 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:43:52,647 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 15:43:52,879 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:43:52,879 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 15:43:52,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-02 15:43:53,034 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 15:43:53,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:43:53,059 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9465 (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_9465) |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 15:43:53,077 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9465 (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_9465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:43:53,097 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (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~mem36#1.base| v_ArrVal_9464))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:43:53,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (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 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:43:53,142 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (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~mem35#1.base| v_ArrVal_9463))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:43:53,818 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9511 (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~mem33#1.base| v_ArrVal_9511))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9463)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9464)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:43:53,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [923467734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:43:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573190933] [2023-12-02 15:43:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:43:53,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:43:53,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:43:53,825 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:43:53,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 15:43:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:43:54,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 15:43:54,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:43:54,528 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 15:43:54,731 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:43:54,732 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 15:43:54,815 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 15:43:55,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:43:55,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:43:55,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:43:55,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:43:55,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:43:55,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:43:56,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:43:56,013 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 15:43:56,155 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 15:43:56,161 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 15:43:56,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:43:56,196 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 15:43:56,196 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 15:43:56,208 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem37#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 15:43:56,221 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 15:43:56,237 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9948)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 15:43:56,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9948))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 15:43:56,272 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9947))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9948)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 15:43:56,290 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9947))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9948)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 15:43:56,789 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9995 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9995))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9947)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9948)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9949) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 15:43:56,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573190933] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:43:56,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:43:56,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2023-12-02 15:43:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513291859] [2023-12-02 15:43:56,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:43:56,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 15:43:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:43:56,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 15:43:56,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1082, Unknown=26, NotChecked=1634, Total=2970 [2023-12-02 15:43:56,796 INFO L87 Difference]: Start difference. First operand 1773 states and 2445 transitions. Second operand has 33 states, 29 states have (on average 5.172413793103448) internal successors, (150), 33 states have internal predecessors, (150), 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 15:44:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:44:25,568 INFO L93 Difference]: Finished difference Result 2298 states and 2728 transitions. [2023-12-02 15:44:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 15:44:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 5.172413793103448) internal successors, (150), 33 states have internal predecessors, (150), 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 15:44:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:44:25,573 INFO L225 Difference]: With dead ends: 2298 [2023-12-02 15:44:25,573 INFO L226 Difference]: Without dead ends: 2298 [2023-12-02 15:44:25,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=278, Invalid=1412, Unknown=26, NotChecked=1824, Total=3540 [2023-12-02 15:44:25,574 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 2199 mSDsluCounter, 6055 mSDsCounter, 0 mSdLazyCounter, 9187 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 9244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 9187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:44:25,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 6573 Invalid, 9244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 9187 Invalid, 0 Unknown, 0 Unchecked, 28.1s Time] [2023-12-02 15:44:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2023-12-02 15:44:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1772. [2023-12-02 15:44:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1365 states have (on average 1.7633699633699633) internal successors, (2407), 1752 states have internal predecessors, (2407), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-12-02 15:44:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2442 transitions. [2023-12-02 15:44:25,591 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2442 transitions. Word has length 110 [2023-12-02 15:44:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:44:25,592 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2442 transitions. [2023-12-02 15:44:25,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 5.172413793103448) internal successors, (150), 33 states have internal predecessors, (150), 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 15:44:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2442 transitions. [2023-12-02 15:44:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 15:44:25,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:44:25,593 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 15:44:25,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-12-02 15:44:25,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 15:44:26,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:44:26,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:44:26,193 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-12-02 15:44:26,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:44:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2040875412, now seen corresponding path program 1 times [2023-12-02 15:44:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:44:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024495094] [2023-12-02 15:44:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:44:26,194 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 15:44:26,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:44:26,195 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:44:26,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/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 15:44:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:44:27,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 15:44:27,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:44:27,359 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 15:44:27,557 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:44:27,557 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 15:44:27,573 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 15:44:27,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:44:27,622 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 15:44:27,775 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 15:44:27,782 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 15:44:28,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:44:28,827 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 15:44:28,846 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 15:44:29,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:44:29,004 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 15:44:29,021 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 15:44:29,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:44:29,144 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 15:44:29,157 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 15:44:29,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:44:29,295 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 15:44:29,314 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 15:44:29,331 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 15:44:29,351 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 15:44:29,403 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 15:44:29,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:44:29,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (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)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 15:44:29,664 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_10481 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10481) |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_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:44:29,715 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~mem36#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~mem36#1.base| v_ArrVal_10479) .cse0 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10481 (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~mem36#1.base| v_ArrVal_10479) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10481) |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 15:44:29,763 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_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10481 (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_10481) |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 15:44:29,829 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~mem35#1.base| v_ArrVal_10477))) (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~mem35#1.base| v_ArrVal_10478) .cse0 v_ArrVal_10479) .cse1 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10481 (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~mem35#1.base| v_ArrVal_10477))) (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~mem35#1.base| v_ArrVal_10478) .cse6 v_ArrVal_10479) (select (select (store .cse7 .cse6 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10481))) |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 15:44:29,902 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_10481 (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 ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10477))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10478) .cse2 v_ArrVal_10479) (select (select (store .cse3 .cse2 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10481))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (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))) (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 ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10477))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10480))) (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_10478) .cse5 v_ArrVal_10479) .cse6 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 15:44:31,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10481 (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 ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10574))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10477))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10573) .cse1 v_ArrVal_10478) .cse2 v_ArrVal_10479) (select (select (store .cse3 .cse2 v_ArrVal_10480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10481))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (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))) (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 ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10574))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10477))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10480))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10573) .cse6 v_ArrVal_10478) .cse7 v_ArrVal_10479) .cse8 v_ArrVal_10481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 15:44:31,467 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:44:31,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024495094] [2023-12-02 15:44:31,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024495094] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:44:31,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1091868769] [2023-12-02 15:44:31,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:44:31,467 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:44:31,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:44:31,468 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:44:31,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1efb9-962a-4794-b868-de4a53d7740d/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process