./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/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_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/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_ee6766e7-24ea-40f5-a1be-22989da8ef05/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 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:55:15,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:55:15,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 12:55:15,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:55:15,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:55:15,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:55:15,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:55:15,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:55:15,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:55:15,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:55:15,108 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:55:15,108 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:55:15,109 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:55:15,109 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:55:15,110 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:55:15,110 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:55:15,111 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:55:15,111 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:55:15,112 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:55:15,112 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:55:15,113 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:55:15,113 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:55:15,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:55:15,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:55:15,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:55:15,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:55:15,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:55:15,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:55:15,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:55:15,117 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:55:15,117 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:55:15,118 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:55:15,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:55:15,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:55:15,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:55:15,119 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:55:15,120 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:55:15,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:55:15,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:55:15,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:55:15,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:55:15,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:55:15,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:55:15,121 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:55:15,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:55:15,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:55:15,122 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:55:15,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:55:15,122 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_ee6766e7-24ea-40f5-a1be-22989da8ef05/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_ee6766e7-24ea-40f5-a1be-22989da8ef05/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 -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2023-12-02 12:55:15,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:55:15,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:55:15,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:55:15,349 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:55:15,350 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:55:15,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2023-12-02 12:55:18,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:55:18,411 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:55:18,412 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2023-12-02 12:55:18,431 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data/003001217/73364c44f84043c5ab50e06268d8930d/FLAG75f5dbf01 [2023-12-02 12:55:18,446 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data/003001217/73364c44f84043c5ab50e06268d8930d [2023-12-02 12:55:18,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:55:18,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:55:18,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:55:18,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:55:18,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:55:18,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:55:18" (1/1) ... [2023-12-02 12:55:18,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1647892b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:18, skipping insertion in model container [2023-12-02 12:55:18,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:55:18" (1/1) ... [2023-12-02 12:55:18,531 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:55:19,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:55:19,196 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 12:55:19,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c170718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:19, skipping insertion in model container [2023-12-02 12:55:19,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:55:19,198 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 12:55:19,200 INFO L158 Benchmark]: Toolchain (without parser) took 748.44ms. Allocated memory is still 148.9MB. Free memory was 98.8MB in the beginning and 76.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 12:55:19,200 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:55:19,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.91ms. Allocated memory is still 148.9MB. Free memory was 98.8MB in the beginning and 76.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 12:55:19,202 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.16ms. Allocated memory is still 98.6MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 745.91ms. Allocated memory is still 148.9MB. Free memory was 98.8MB in the beginning and 76.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/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_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/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_ee6766e7-24ea-40f5-a1be-22989da8ef05/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 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:55:20,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:55:20,978 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 12:55:20,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:55:20,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:55:21,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:55:21,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:55:21,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:55:21,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:55:21,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:55:21,015 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:55:21,016 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:55:21,016 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:55:21,017 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:55:21,017 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:55:21,018 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:55:21,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:55:21,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:55:21,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:55:21,021 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:55:21,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:55:21,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:55:21,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:55:21,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:55:21,023 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:55:21,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:55:21,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:55:21,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:55:21,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 12:55:21,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 12:55:21,026 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:55:21,026 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:55:21,026 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:55:21,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:55:21,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 12:55:21,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:55:21,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:55:21,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:55:21,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:55:21,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:55:21,028 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 12:55:21,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 12:55:21,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:55:21,029 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:55:21,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:55:21,030 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_ee6766e7-24ea-40f5-a1be-22989da8ef05/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_ee6766e7-24ea-40f5-a1be-22989da8ef05/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 -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2023-12-02 12:55:21,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:55:21,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:55:21,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:55:21,337 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:55:21,337 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:55:21,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2023-12-02 12:55:24,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:55:24,437 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:55:24,437 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2023-12-02 12:55:24,458 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data/87fa07607/3a458009f35e4437b9369e79e0a55cc2/FLAG3bb0bf40e [2023-12-02 12:55:24,473 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/data/87fa07607/3a458009f35e4437b9369e79e0a55cc2 [2023-12-02 12:55:24,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:55:24,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:55:24,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:55:24,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:55:24,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:55:24,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:55:24" (1/1) ... [2023-12-02 12:55:24,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345b19f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:24, skipping insertion in model container [2023-12-02 12:55:24,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:55:24" (1/1) ... [2023-12-02 12:55:24,557 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:55:25,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:55:25,217 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 12:55:25,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:55:25,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:55:25,336 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:55:25,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:55:25,480 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 12:55:25,488 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:55:25,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25 WrapperNode [2023-12-02 12:55:25,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:55:25,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:55:25,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:55:25,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:55:25,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,601 INFO L138 Inliner]: procedures = 285, calls = 351, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1213 [2023-12-02 12:55:25,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:55:25,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:55:25,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:55:25,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:55:25,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:55:25,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:55:25,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:55:25,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:55:25,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (1/1) ... [2023-12-02 12:55:25,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:55:25,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:55:25,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:55:25,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:55:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 12:55:25,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 12:55:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 12:55:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 12:55:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:55:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 12:55:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:55:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:55:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 12:55:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 12:55:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2023-12-02 12:55:25,791 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2023-12-02 12:55:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 12:55:25,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 12:55:25,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:55:25,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:55:25,792 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2023-12-02 12:55:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2023-12-02 12:55:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:55:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2023-12-02 12:55:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2023-12-02 12:55:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:55:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:55:26,003 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:55:26,006 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:55:30,782 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:55:30,944 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:55:30,944 INFO L309 CfgBuilder]: Removed 72 assume(true) statements. [2023-12-02 12:55:30,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:55:30 BoogieIcfgContainer [2023-12-02 12:55:30,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:55:30,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:55:30,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:55:30,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:55:30,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:55:24" (1/3) ... [2023-12-02 12:55:30,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b09508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:55:30, skipping insertion in model container [2023-12-02 12:55:30,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:55:25" (2/3) ... [2023-12-02 12:55:30,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b09508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:55:30, skipping insertion in model container [2023-12-02 12:55:30,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:55:30" (3/3) ... [2023-12-02 12:55:30,953 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-2.i [2023-12-02 12:55:30,969 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:55:30,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 631 error locations. [2023-12-02 12:55:31,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:55:31,036 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;@1fb41fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:55:31,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 631 error locations. [2023-12-02 12:55:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 1163 states, 507 states have (on average 2.5305719921104535) internal successors, (1283), 1141 states have internal predecessors, (1283), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 12:55:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:55:31,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:31,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:55:31,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:31,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 64540, now seen corresponding path program 1 times [2023-12-02 12:55:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:31,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970619950] [2023-12-02 12:55:31,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:31,066 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 12:55:31,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:31,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:31,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:31,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:55:31,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:31,341 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 12:55:31,352 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 12:55:31,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:31,353 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970619950] [2023-12-02 12:55:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970619950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:31,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:31,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:55:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387897406] [2023-12-02 12:55:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:31,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:55:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:55:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:55:31,394 INFO L87 Difference]: Start difference. First operand has 1163 states, 507 states have (on average 2.5305719921104535) internal successors, (1283), 1141 states have internal predecessors, (1283), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 12:55:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:34,062 INFO L93 Difference]: Finished difference Result 1400 states and 1492 transitions. [2023-12-02 12:55:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:55:34,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 12:55:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:34,081 INFO L225 Difference]: With dead ends: 1400 [2023-12-02 12:55:34,081 INFO L226 Difference]: Without dead ends: 1399 [2023-12-02 12:55:34,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 12:55:34,085 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 828 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:34,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1044 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 12:55:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2023-12-02 12:55:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1176. [2023-12-02 12:55:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 535 states have (on average 2.3626168224299064) internal successors, (1264), 1156 states have internal predecessors, (1264), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 12:55:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1298 transitions. [2023-12-02 12:55:34,173 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1298 transitions. Word has length 2 [2023-12-02 12:55:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:34,173 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1298 transitions. [2023-12-02 12:55:34,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 12:55:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1298 transitions. [2023-12-02 12:55:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:55:34,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:34,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:55:34,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:34,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:34,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:34,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 64541, now seen corresponding path program 1 times [2023-12-02 12:55:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:34,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896531706] [2023-12-02 12:55:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:34,376 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 12:55:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:34,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:34,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:34,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:55:34,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:34,509 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 12:55:34,520 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 12:55:34,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:34,520 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896531706] [2023-12-02 12:55:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896531706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:55:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925316435] [2023-12-02 12:55:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:34,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:55:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:55:34,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:55:34,523 INFO L87 Difference]: Start difference. First operand 1176 states and 1298 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 12:55:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:38,348 INFO L93 Difference]: Finished difference Result 1715 states and 1886 transitions. [2023-12-02 12:55:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:55:38,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 12:55:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:38,357 INFO L225 Difference]: With dead ends: 1715 [2023-12-02 12:55:38,357 INFO L226 Difference]: Without dead ends: 1715 [2023-12-02 12:55:38,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 12:55:38,359 INFO L413 NwaCegarLoop]: 865 mSDtfsCounter, 572 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:38,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1449 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 12:55:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-12-02 12:55:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1346. [2023-12-02 12:55:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 704 states have (on average 2.3323863636363638) internal successors, (1642), 1324 states have internal predecessors, (1642), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-02 12:55:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1680 transitions. [2023-12-02 12:55:38,393 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1680 transitions. Word has length 2 [2023-12-02 12:55:38,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:38,394 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1680 transitions. [2023-12-02 12:55:38,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 12:55:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1680 transitions. [2023-12-02 12:55:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 12:55:38,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:38,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 12:55:38,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:38,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:38,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:38,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -522425799, now seen corresponding path program 1 times [2023-12-02 12:55:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231119575] [2023-12-02 12:55:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:38,597 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 12:55:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:38,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:38,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:38,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 12:55:38,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:38,750 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 12:55:38,758 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 12:55:38,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:55:38,825 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 12:55:38,876 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:55:38,876 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 12:55:38,898 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 12:55:38,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:38,899 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231119575] [2023-12-02 12:55:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231119575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:55:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369497330] [2023-12-02 12:55:38,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:38,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:55:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:38,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:55:38,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:55:38,901 INFO L87 Difference]: Start difference. First operand 1346 states and 1680 transitions. Second operand has 4 states, 3 states have (on average 2.0) 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 12:55:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:43,911 INFO L93 Difference]: Finished difference Result 2319 states and 2733 transitions. [2023-12-02 12:55:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:55:43,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) 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 12:55:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:43,924 INFO L225 Difference]: With dead ends: 2319 [2023-12-02 12:55:43,924 INFO L226 Difference]: Without dead ends: 2319 [2023-12-02 12:55:43,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 12:55:43,926 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 1832 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:43,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 1182 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-02 12:55:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-12-02 12:55:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1462. [2023-12-02 12:55:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 820 states have (on average 2.3121951219512193) internal successors, (1896), 1440 states have internal predecessors, (1896), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-02 12:55:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1934 transitions. [2023-12-02 12:55:43,972 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1934 transitions. Word has length 6 [2023-12-02 12:55:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:43,972 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1934 transitions. [2023-12-02 12:55:43,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) 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 12:55:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1934 transitions. [2023-12-02 12:55:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 12:55:43,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:43,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:55:43,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:44,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:44,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:44,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 984669438, now seen corresponding path program 1 times [2023-12-02 12:55:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050234572] [2023-12-02 12:55:44,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:44,175 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 12:55:44,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:44,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:44,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:44,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:55:44,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:44,310 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 12:55:44,322 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 12:55:44,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:44,323 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050234572] [2023-12-02 12:55:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050234572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:44,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:44,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:55:44,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584314833] [2023-12-02 12:55:44,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:44,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:55:44,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:44,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:55:44,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:55:44,325 INFO L87 Difference]: Start difference. First operand 1462 states and 1934 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 12:55:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:46,598 INFO L93 Difference]: Finished difference Result 1941 states and 2638 transitions. [2023-12-02 12:55:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:55:46,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-12-02 12:55:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:46,607 INFO L225 Difference]: With dead ends: 1941 [2023-12-02 12:55:46,607 INFO L226 Difference]: Without dead ends: 1941 [2023-12-02 12:55:46,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 12:55:46,608 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 869 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:46,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1335 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 12:55:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2023-12-02 12:55:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1417. [2023-12-02 12:55:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 820 states have (on average 2.2402439024390244) internal successors, (1837), 1395 states have internal predecessors, (1837), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-02 12:55:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1875 transitions. [2023-12-02 12:55:46,637 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1875 transitions. Word has length 7 [2023-12-02 12:55:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:46,637 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1875 transitions. [2023-12-02 12:55:46,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 12:55:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1875 transitions. [2023-12-02 12:55:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 12:55:46,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:46,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:55:46,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:46,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:46,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:46,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash 984669439, now seen corresponding path program 1 times [2023-12-02 12:55:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567196735] [2023-12-02 12:55:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:46,841 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 12:55:46,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:46,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:46,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:46,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:55:46,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:46,978 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 12:55:47,002 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 12:55:47,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:47,002 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:47,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567196735] [2023-12-02 12:55:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567196735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:47,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:47,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:55:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717494321] [2023-12-02 12:55:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:47,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:55:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:55:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:55:47,005 INFO L87 Difference]: Start difference. First operand 1417 states and 1875 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 12:55:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:50,633 INFO L93 Difference]: Finished difference Result 1974 states and 2627 transitions. [2023-12-02 12:55:50,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:55:50,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-12-02 12:55:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:50,642 INFO L225 Difference]: With dead ends: 1974 [2023-12-02 12:55:50,642 INFO L226 Difference]: Without dead ends: 1974 [2023-12-02 12:55:50,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 12:55:50,643 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 620 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:50,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1600 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 12:55:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2023-12-02 12:55:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1407. [2023-12-02 12:55:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 820 states have (on average 2.2109756097560975) internal successors, (1813), 1385 states have internal predecessors, (1813), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-02 12:55:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1851 transitions. [2023-12-02 12:55:50,672 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1851 transitions. Word has length 7 [2023-12-02 12:55:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:50,672 INFO L495 AbstractCegarLoop]: Abstraction has 1407 states and 1851 transitions. [2023-12-02 12:55:50,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 12:55:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1851 transitions. [2023-12-02 12:55:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 12:55:50,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:50,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:55:50,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:50,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:50,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:50,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash -320660464, now seen corresponding path program 1 times [2023-12-02 12:55:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197988835] [2023-12-02 12:55:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:50,877 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 12:55:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:50,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:50,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:51,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:55:51,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:51,087 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 12:55:51,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:51,087 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:51,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197988835] [2023-12-02 12:55:51,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197988835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:51,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:51,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:55:51,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586462385] [2023-12-02 12:55:51,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:51,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:55:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:55:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:55:51,089 INFO L87 Difference]: Start difference. First operand 1407 states and 1851 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:55:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:53,254 INFO L93 Difference]: Finished difference Result 2018 states and 2566 transitions. [2023-12-02 12:55:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:55:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 12:55:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:53,264 INFO L225 Difference]: With dead ends: 2018 [2023-12-02 12:55:53,265 INFO L226 Difference]: Without dead ends: 2018 [2023-12-02 12:55:53,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:55:53,265 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 682 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:53,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 3075 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 12:55:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2023-12-02 12:55:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1624. [2023-12-02 12:55:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1034 states have (on average 2.2088974854932304) internal successors, (2284), 1599 states have internal predecessors, (2284), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 12:55:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2328 transitions. [2023-12-02 12:55:53,306 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2328 transitions. Word has length 12 [2023-12-02 12:55:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:53,307 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2328 transitions. [2023-12-02 12:55:53,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:55:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2328 transitions. [2023-12-02 12:55:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 12:55:53,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:53,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:55:53,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-02 12:55:53,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:53,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:53,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -909869265, now seen corresponding path program 1 times [2023-12-02 12:55:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:53,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152639940] [2023-12-02 12:55:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:53,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:55:53,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:53,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:53,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:53,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 12:55:53,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:53,649 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 12:55:53,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:53,649 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:53,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152639940] [2023-12-02 12:55:53,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152639940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:53,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:53,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:55:53,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928264249] [2023-12-02 12:55:53,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:53,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:55:53,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:53,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:55:53,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:55:53,651 INFO L87 Difference]: Start difference. First operand 1624 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:55:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:54,575 INFO L93 Difference]: Finished difference Result 1540 states and 2168 transitions. [2023-12-02 12:55:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:55:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 12:55:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:54,584 INFO L225 Difference]: With dead ends: 1540 [2023-12-02 12:55:54,584 INFO L226 Difference]: Without dead ends: 1540 [2023-12-02 12:55:54,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 12:55:54,585 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 70 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:54,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1935 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 12:55:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2023-12-02 12:55:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1540. [2023-12-02 12:55:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 974 states have (on average 2.1806981519507187) internal successors, (2124), 1515 states have internal predecessors, (2124), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 12:55:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2168 transitions. [2023-12-02 12:55:54,617 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2168 transitions. Word has length 12 [2023-12-02 12:55:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:54,617 INFO L495 AbstractCegarLoop]: Abstraction has 1540 states and 2168 transitions. [2023-12-02 12:55:54,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:55:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2168 transitions. [2023-12-02 12:55:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 12:55:54,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:54,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:55:54,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:54,822 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:54,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash -607253788, now seen corresponding path program 1 times [2023-12-02 12:55:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536457291] [2023-12-02 12:55:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:54,822 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 12:55:54,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:54,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:54,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:54,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 12:55:54,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:54,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:55:54,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:55:54,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:55:54,988 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 30 treesize of output 39 [2023-12-02 12:55:55,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:55:55,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-12-02 12:55:55,064 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 12:55:55,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:55,064 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:55,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536457291] [2023-12-02 12:55:55,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536457291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:55,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:55,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:55:55,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39236586] [2023-12-02 12:55:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:55,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:55:55,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:55:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:55:55,067 INFO L87 Difference]: Start difference. First operand 1540 states and 2168 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:55:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:57,418 INFO L93 Difference]: Finished difference Result 1704 states and 2090 transitions. [2023-12-02 12:55:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:55:57,419 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 12:55:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:57,425 INFO L225 Difference]: With dead ends: 1704 [2023-12-02 12:55:57,425 INFO L226 Difference]: Without dead ends: 1704 [2023-12-02 12:55:57,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:55:57,426 INFO L413 NwaCegarLoop]: 1125 mSDtfsCounter, 426 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:57,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 3177 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 12:55:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2023-12-02 12:55:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1273. [2023-12-02 12:55:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 709 states have (on average 2.1763046544428772) internal successors, (1543), 1250 states have internal predecessors, (1543), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 12:55:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1583 transitions. [2023-12-02 12:55:57,453 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1583 transitions. Word has length 15 [2023-12-02 12:55:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:57,453 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1583 transitions. [2023-12-02 12:55:57,453 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:55:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1583 transitions. [2023-12-02 12:55:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 12:55:57,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:57,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:55:57,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:57,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:57,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:57,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:57,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1442573483, now seen corresponding path program 1 times [2023-12-02 12:55:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624075774] [2023-12-02 12:55:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:57,656 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 12:55:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:57,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:57,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:57,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 12:55:57,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:57,892 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 12:55:57,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:57,892 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624075774] [2023-12-02 12:55:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624075774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:55:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016311935] [2023-12-02 12:55:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:57,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:55:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:55:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:55:57,893 INFO L87 Difference]: Start difference. First operand 1273 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 12:55:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:55:58,763 INFO L93 Difference]: Finished difference Result 1219 states and 1503 transitions. [2023-12-02 12:55:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:55:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-12-02 12:55:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:55:58,769 INFO L225 Difference]: With dead ends: 1219 [2023-12-02 12:55:58,769 INFO L226 Difference]: Without dead ends: 1219 [2023-12-02 12:55:58,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 12:55:58,770 INFO L413 NwaCegarLoop]: 955 mSDtfsCounter, 70 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:55:58,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1861 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 12:55:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-12-02 12:55:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2023-12-02 12:55:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 679 states have (on average 2.154639175257732) internal successors, (1463), 1196 states have internal predecessors, (1463), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 12:55:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1503 transitions. [2023-12-02 12:55:58,794 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1503 transitions. Word has length 15 [2023-12-02 12:55:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:55:58,794 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1503 transitions. [2023-12-02 12:55:58,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 12:55:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1503 transitions. [2023-12-02 12:55:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 12:55:58,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:55:58,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:55:58,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Ended with exit code 0 [2023-12-02 12:55:58,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:58,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:55:58,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:55:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash 961317391, now seen corresponding path program 1 times [2023-12-02 12:55:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:55:58,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598406016] [2023-12-02 12:55:58,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:55:58,997 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 12:55:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:55:58,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:58,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:55:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:55:59,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:55:59,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:55:59,188 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 12:55:59,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:55:59,188 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:55:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598406016] [2023-12-02 12:55:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598406016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:55:59,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:55:59,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:55:59,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456516558] [2023-12-02 12:55:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:55:59,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:55:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:55:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:55:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:55:59,190 INFO L87 Difference]: Start difference. First operand 1219 states and 1503 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 12:56:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:00,429 INFO L93 Difference]: Finished difference Result 1205 states and 1461 transitions. [2023-12-02 12:56:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:56:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-12-02 12:56:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:00,436 INFO L225 Difference]: With dead ends: 1205 [2023-12-02 12:56:00,436 INFO L226 Difference]: Without dead ends: 1205 [2023-12-02 12:56:00,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 12:56:00,437 INFO L413 NwaCegarLoop]: 924 mSDtfsCounter, 58 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:00,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2748 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 12:56:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-12-02 12:56:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1203. [2023-12-02 12:56:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 677 states have (on average 2.0960118168389954) internal successors, (1419), 1180 states have internal predecessors, (1419), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 12:56:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1459 transitions. [2023-12-02 12:56:00,452 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1459 transitions. Word has length 17 [2023-12-02 12:56:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:00,453 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1459 transitions. [2023-12-02 12:56:00,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 12:56:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1459 transitions. [2023-12-02 12:56:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 12:56:00,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:00,454 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] [2023-12-02 12:56:00,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:00,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:00,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:00,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash 656934686, now seen corresponding path program 1 times [2023-12-02 12:56:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830032186] [2023-12-02 12:56:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:00,656 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 12:56:00,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:00,657 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:00,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:00,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 12:56:00,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:00,830 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 12:56:01,034 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 12:56:01,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:01,034 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:01,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830032186] [2023-12-02 12:56:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830032186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:56:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895389491] [2023-12-02 12:56:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:01,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:56:01,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:01,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:56:01,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:56:01,036 INFO L87 Difference]: Start difference. First operand 1203 states and 1459 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 12:56:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:05,491 INFO L93 Difference]: Finished difference Result 1670 states and 2052 transitions. [2023-12-02 12:56:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:56:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-12-02 12:56:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:05,497 INFO L225 Difference]: With dead ends: 1670 [2023-12-02 12:56:05,498 INFO L226 Difference]: Without dead ends: 1670 [2023-12-02 12:56:05,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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 12:56:05,498 INFO L413 NwaCegarLoop]: 1124 mSDtfsCounter, 523 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:05,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2238 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-02 12:56:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2023-12-02 12:56:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1199. [2023-12-02 12:56:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 677 states have (on average 2.0841949778434268) internal successors, (1411), 1176 states have internal predecessors, (1411), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 12:56:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1451 transitions. [2023-12-02 12:56:05,515 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1451 transitions. Word has length 31 [2023-12-02 12:56:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:05,515 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1451 transitions. [2023-12-02 12:56:05,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 12:56:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1451 transitions. [2023-12-02 12:56:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 12:56:05,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:05,516 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] [2023-12-02 12:56:05,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 12:56:05,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:05,717 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:05,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash 656934685, now seen corresponding path program 1 times [2023-12-02 12:56:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479208732] [2023-12-02 12:56:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:05,717 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 12:56:05,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:05,718 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:05,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:05,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:56:05,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:05,894 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 12:56:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:56:05,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:05,962 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479208732] [2023-12-02 12:56:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479208732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:05,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:56:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102555807] [2023-12-02 12:56:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:05,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:56:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:56:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:56:05,964 INFO L87 Difference]: Start difference. First operand 1199 states and 1451 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 12:56:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:08,565 INFO L93 Difference]: Finished difference Result 1579 states and 1953 transitions. [2023-12-02 12:56:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:56:08,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-12-02 12:56:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:08,571 INFO L225 Difference]: With dead ends: 1579 [2023-12-02 12:56:08,571 INFO L226 Difference]: Without dead ends: 1579 [2023-12-02 12:56:08,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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 12:56:08,572 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 754 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:08,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1386 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 12:56:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2023-12-02 12:56:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1195. [2023-12-02 12:56:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 677 states have (on average 2.072378138847858) internal successors, (1403), 1172 states have internal predecessors, (1403), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 12:56:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1443 transitions. [2023-12-02 12:56:08,587 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1443 transitions. Word has length 31 [2023-12-02 12:56:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:08,587 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1443 transitions. [2023-12-02 12:56:08,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 12:56:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1443 transitions. [2023-12-02 12:56:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 12:56:08,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:08,589 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] [2023-12-02 12:56:08,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:08,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:08,789 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:08,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash 863160283, now seen corresponding path program 1 times [2023-12-02 12:56:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:08,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495564455] [2023-12-02 12:56:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:08,790 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 12:56:08,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:08,791 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:08,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:09,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:56:09,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:09,082 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 12:56:09,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:09,083 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495564455] [2023-12-02 12:56:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495564455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:56:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840270201] [2023-12-02 12:56:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:09,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:56:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:56:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:56:09,085 INFO L87 Difference]: Start difference. First operand 1195 states and 1443 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:10,196 INFO L93 Difference]: Finished difference Result 1183 states and 1423 transitions. [2023-12-02 12:56:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:56:10,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-02 12:56:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:10,202 INFO L225 Difference]: With dead ends: 1183 [2023-12-02 12:56:10,202 INFO L226 Difference]: Without dead ends: 1183 [2023-12-02 12:56:10,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 12:56:10,203 INFO L413 NwaCegarLoop]: 918 mSDtfsCounter, 23 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:10,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2734 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 12:56:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2023-12-02 12:56:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2023-12-02 12:56:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 665 states have (on average 2.079699248120301) internal successors, (1383), 1160 states have internal predecessors, (1383), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 12:56:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1423 transitions. [2023-12-02 12:56:10,217 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1423 transitions. Word has length 51 [2023-12-02 12:56:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:10,217 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1423 transitions. [2023-12-02 12:56:10,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1423 transitions. [2023-12-02 12:56:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 12:56:10,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:10,219 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] [2023-12-02 12:56:10,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:10,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:10,419 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:10,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash 926748, now seen corresponding path program 1 times [2023-12-02 12:56:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37964348] [2023-12-02 12:56:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:10,420 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 12:56:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:10,421 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:10,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:10,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 12:56:10,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:10,751 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-12-02 12:56:10,752 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 16 treesize of output 17 [2023-12-02 12:56:10,810 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-02 12:56:10,810 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 18 treesize of output 28 [2023-12-02 12:56:11,468 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 12:56:11,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:11,469 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37964348] [2023-12-02 12:56:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37964348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:11,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:11,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:56:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434114634] [2023-12-02 12:56:11,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:11,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:56:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:11,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:56:11,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:56:11,471 INFO L87 Difference]: Start difference. First operand 1183 states and 1423 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:15,847 INFO L93 Difference]: Finished difference Result 2171 states and 2607 transitions. [2023-12-02 12:56:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:56:15,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-02 12:56:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:15,859 INFO L225 Difference]: With dead ends: 2171 [2023-12-02 12:56:15,859 INFO L226 Difference]: Without dead ends: 2171 [2023-12-02 12:56:15,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:56:15,860 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 1763 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:15,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 1777 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 12:56:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2023-12-02 12:56:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1546. [2023-12-02 12:56:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1012 states have (on average 2.0622529644268774) internal successors, (2087), 1510 states have internal predecessors, (2087), 35 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-02 12:56:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2153 transitions. [2023-12-02 12:56:15,887 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2153 transitions. Word has length 55 [2023-12-02 12:56:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:15,887 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2153 transitions. [2023-12-02 12:56:15,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2153 transitions. [2023-12-02 12:56:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 12:56:15,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:15,888 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] [2023-12-02 12:56:15,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:16,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:16,089 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:16,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash 926749, now seen corresponding path program 1 times [2023-12-02 12:56:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:16,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311100746] [2023-12-02 12:56:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:16,090 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 12:56:16,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:16,091 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:16,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:16,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 12:56:16,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:56:16,475 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 12:56:16,538 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 12:56:16,539 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 12 treesize of output 14 [2023-12-02 12:56:17,199 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 12:56:17,199 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:17,199 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311100746] [2023-12-02 12:56:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311100746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:56:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681854431] [2023-12-02 12:56:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:17,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:56:17,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:17,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:56:17,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:56:17,202 INFO L87 Difference]: Start difference. First operand 1546 states and 2153 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:20,697 INFO L93 Difference]: Finished difference Result 1551 states and 2159 transitions. [2023-12-02 12:56:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:56:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-02 12:56:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:20,702 INFO L225 Difference]: With dead ends: 1551 [2023-12-02 12:56:20,703 INFO L226 Difference]: Without dead ends: 1551 [2023-12-02 12:56:20,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:56:20,703 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 0 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:20,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1906 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-02 12:56:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2023-12-02 12:56:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2023-12-02 12:56:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1016 states have (on average 2.0580708661417324) internal successors, (2091), 1514 states have internal predecessors, (2091), 36 states have call successors, (36), 10 states have call predecessors, (36), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 12:56:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2159 transitions. [2023-12-02 12:56:20,728 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2159 transitions. Word has length 55 [2023-12-02 12:56:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:20,729 INFO L495 AbstractCegarLoop]: Abstraction has 1551 states and 2159 transitions. [2023-12-02 12:56:20,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2159 transitions. [2023-12-02 12:56:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 12:56:20,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:20,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:56:20,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 12:56:20,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:20,930 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:20,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:20,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1243031911, now seen corresponding path program 1 times [2023-12-02 12:56:20,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:20,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490399048] [2023-12-02 12:56:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:20,931 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 12:56:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:20,932 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:20,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 12:56:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:21,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:56:21,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:21,297 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 12:56:21,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:21,297 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:21,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490399048] [2023-12-02 12:56:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490399048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:56:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340109321] [2023-12-02 12:56:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:21,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:56:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:56:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:56:21,299 INFO L87 Difference]: Start difference. First operand 1551 states and 2159 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:56:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:23,028 INFO L93 Difference]: Finished difference Result 1555 states and 2167 transitions. [2023-12-02 12:56:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:56:23,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-12-02 12:56:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:23,035 INFO L225 Difference]: With dead ends: 1555 [2023-12-02 12:56:23,036 INFO L226 Difference]: Without dead ends: 1555 [2023-12-02 12:56:23,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:56:23,036 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 19 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:23,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3597 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 12:56:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2023-12-02 12:56:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1553. [2023-12-02 12:56:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1017 states have (on average 2.057030481809243) internal successors, (2092), 1515 states have internal predecessors, (2092), 36 states have call successors, (36), 10 states have call predecessors, (36), 8 states have return successors, (35), 28 states have call predecessors, (35), 32 states have call successors, (35) [2023-12-02 12:56:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2163 transitions. [2023-12-02 12:56:23,063 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2163 transitions. Word has length 59 [2023-12-02 12:56:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:23,063 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 2163 transitions. [2023-12-02 12:56:23,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 12:56:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2163 transitions. [2023-12-02 12:56:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 12:56:23,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:23,064 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, 1] [2023-12-02 12:56:23,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-02 12:56:23,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:23,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:23,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 541184168, now seen corresponding path program 1 times [2023-12-02 12:56:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713430285] [2023-12-02 12:56:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:23,266 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 12:56:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:23,267 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:23,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 12:56:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:23,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:56:23,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:23,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 12:56:23,580 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:23,580 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:23,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713430285] [2023-12-02 12:56:23,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713430285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:23,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:23,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:56:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720132077] [2023-12-02 12:56:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:23,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:56:23,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:56:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:56:23,582 INFO L87 Difference]: Start difference. First operand 1553 states and 2163 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:25,454 INFO L93 Difference]: Finished difference Result 1577 states and 2187 transitions. [2023-12-02 12:56:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:56:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-02 12:56:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:25,461 INFO L225 Difference]: With dead ends: 1577 [2023-12-02 12:56:25,461 INFO L226 Difference]: Without dead ends: 1577 [2023-12-02 12:56:25,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:56:25,461 INFO L413 NwaCegarLoop]: 930 mSDtfsCounter, 16 mSDsluCounter, 3713 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4643 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:25,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4643 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 12:56:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2023-12-02 12:56:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1573. [2023-12-02 12:56:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1031 states have (on average 2.0475266731328805) internal successors, (2111), 1531 states have internal predecessors, (2111), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-12-02 12:56:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2184 transitions. [2023-12-02 12:56:25,484 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2184 transitions. Word has length 62 [2023-12-02 12:56:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:25,484 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2184 transitions. [2023-12-02 12:56:25,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:56:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2184 transitions. [2023-12-02 12:56:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 12:56:25,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:25,485 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, 1, 1, 1] [2023-12-02 12:56:25,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-02 12:56:25,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:25,685 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:25,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash 498416841, now seen corresponding path program 1 times [2023-12-02 12:56:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860595869] [2023-12-02 12:56:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:25,686 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 12:56:25,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:25,687 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:25,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:26,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 12:56:26,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:26,090 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 12:56:26,206 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2023-12-02 12:56:26,222 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 12:56:26,223 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 12:56:26,232 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 12:56:26,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:26,233 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860595869] [2023-12-02 12:56:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860595869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:26,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:56:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664289959] [2023-12-02 12:56:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:26,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:56:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:56:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 12:56:26,235 INFO L87 Difference]: Start difference. First operand 1573 states and 2184 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:56:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:29,103 INFO L93 Difference]: Finished difference Result 1956 states and 2692 transitions. [2023-12-02 12:56:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:56:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-12-02 12:56:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:29,109 INFO L225 Difference]: With dead ends: 1956 [2023-12-02 12:56:29,109 INFO L226 Difference]: Without dead ends: 1956 [2023-12-02 12:56:29,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 12:56:29,110 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 723 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1401 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:29,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1329 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1341 Invalid, 0 Unknown, 1401 Unchecked, 2.8s Time] [2023-12-02 12:56:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2023-12-02 12:56:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1572. [2023-12-02 12:56:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1031 states have (on average 2.0455868089233755) internal successors, (2109), 1530 states have internal predecessors, (2109), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-12-02 12:56:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2182 transitions. [2023-12-02 12:56:29,143 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2182 transitions. Word has length 64 [2023-12-02 12:56:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:29,144 INFO L495 AbstractCegarLoop]: Abstraction has 1572 states and 2182 transitions. [2023-12-02 12:56:29,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:56:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2182 transitions. [2023-12-02 12:56:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 12:56:29,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:29,144 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, 1, 1, 1] [2023-12-02 12:56:29,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:29,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:29,345 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:29,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash 498416842, now seen corresponding path program 1 times [2023-12-02 12:56:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:29,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353832944] [2023-12-02 12:56:29,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:29,346 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 12:56:29,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:29,347 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:29,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Waiting until timeout for monitored process [2023-12-02 12:56:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:29,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 12:56:29,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:29,769 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 12:56:29,774 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 12:56:30,173 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2023-12-02 12:56:30,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:56:30,187 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 12:56:30,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:56:30,200 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 12:56:30,211 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 12:56:30,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:30,211 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353832944] [2023-12-02 12:56:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353832944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:30,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:30,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:56:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59988608] [2023-12-02 12:56:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:30,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:56:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:56:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-12-02 12:56:30,213 INFO L87 Difference]: Start difference. First operand 1572 states and 2182 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:56:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:36,673 INFO L93 Difference]: Finished difference Result 2515 states and 3479 transitions. [2023-12-02 12:56:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:56:36,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-12-02 12:56:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:36,677 INFO L225 Difference]: With dead ends: 2515 [2023-12-02 12:56:36,677 INFO L226 Difference]: Without dead ends: 2515 [2023-12-02 12:56:36,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-12-02 12:56:36,678 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 835 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 4916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1811 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:36,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1990 Invalid, 4916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3077 Invalid, 0 Unknown, 1811 Unchecked, 6.4s Time] [2023-12-02 12:56:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2023-12-02 12:56:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 1568. [2023-12-02 12:56:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1035 states have (on average 2.026086956521739) internal successors, (2097), 1526 states have internal predecessors, (2097), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-12-02 12:56:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2170 transitions. [2023-12-02 12:56:36,697 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2170 transitions. Word has length 64 [2023-12-02 12:56:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:36,697 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2170 transitions. [2023-12-02 12:56:36,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:56:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2170 transitions. [2023-12-02 12:56:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 12:56:36,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:36,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:56:36,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 12:56:36,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:36,898 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:36,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1620798592, now seen corresponding path program 1 times [2023-12-02 12:56:36,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:36,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69865482] [2023-12-02 12:56:36,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:56:36,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:36,900 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:36,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 12:56:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:37,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 12:56:37,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:37,181 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 12:56:37,202 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 12:56:37,229 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 12:56:37,273 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 12:56:37,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:37,274 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69865482] [2023-12-02 12:56:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69865482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:37,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 12:56:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404982648] [2023-12-02 12:56:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:37,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:56:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:56:37,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:56:37,276 INFO L87 Difference]: Start difference. First operand 1568 states and 2170 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:56:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:42,267 INFO L93 Difference]: Finished difference Result 1579 states and 2182 transitions. [2023-12-02 12:56:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:56:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-12-02 12:56:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:42,271 INFO L225 Difference]: With dead ends: 1579 [2023-12-02 12:56:42,271 INFO L226 Difference]: Without dead ends: 1579 [2023-12-02 12:56:42,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 12:56:42,272 INFO L413 NwaCegarLoop]: 917 mSDtfsCounter, 14 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:42,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3976 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-02 12:56:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2023-12-02 12:56:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1578. [2023-12-02 12:56:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1043 states have (on average 2.022051773729626) internal successors, (2109), 1534 states have internal predecessors, (2109), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-12-02 12:56:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2182 transitions. [2023-12-02 12:56:42,290 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2182 transitions. Word has length 70 [2023-12-02 12:56:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:42,290 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 2182 transitions. [2023-12-02 12:56:42,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 12:56:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2182 transitions. [2023-12-02 12:56:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 12:56:42,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:42,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:56:42,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-02 12:56:42,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:42,491 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:42,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1294851276, now seen corresponding path program 1 times [2023-12-02 12:56:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:42,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754886011] [2023-12-02 12:56:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:56:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:42,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:42,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:42,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 12:56:42,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:42,861 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 12:56:42,893 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 12:56:42,905 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 12:56:42,947 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 12:56:43,027 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 12:56:43,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:43,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:43,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754886011] [2023-12-02 12:56:43,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754886011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:43,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:43,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 12:56:43,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876074420] [2023-12-02 12:56:43,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:43,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:56:43,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:43,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:56:43,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:56:43,030 INFO L87 Difference]: Start difference. First operand 1578 states and 2182 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:56:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:49,760 INFO L93 Difference]: Finished difference Result 1578 states and 2180 transitions. [2023-12-02 12:56:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:56:49,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2023-12-02 12:56:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:49,764 INFO L225 Difference]: With dead ends: 1578 [2023-12-02 12:56:49,764 INFO L226 Difference]: Without dead ends: 1578 [2023-12-02 12:56:49,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 12:56:49,765 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 12 mSDsluCounter, 3814 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4729 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:49,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4729 Invalid, 3543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3542 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-02 12:56:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2023-12-02 12:56:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2023-12-02 12:56:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1043 states have (on average 2.0201342281879193) internal successors, (2107), 1534 states have internal predecessors, (2107), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-12-02 12:56:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2180 transitions. [2023-12-02 12:56:49,785 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2180 transitions. Word has length 71 [2023-12-02 12:56:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:49,785 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 2180 transitions. [2023-12-02 12:56:49,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 12:56:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2180 transitions. [2023-12-02 12:56:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 12:56:49,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:49,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:56:49,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:49,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:49,987 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:49,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash 591418728, now seen corresponding path program 1 times [2023-12-02 12:56:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212554831] [2023-12-02 12:56:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:49,988 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 12:56:49,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:49,989 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:49,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-02 12:56:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:50,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:56:50,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:50,306 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 12:56:50,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:56:50,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212554831] [2023-12-02 12:56:50,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212554831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:56:50,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:56:50,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:56:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361823271] [2023-12-02 12:56:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:56:50,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:56:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:50,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:56:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:56:50,309 INFO L87 Difference]: Start difference. First operand 1578 states and 2180 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 12:56:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:51,718 INFO L93 Difference]: Finished difference Result 1586 states and 2190 transitions. [2023-12-02 12:56:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:56:51,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2023-12-02 12:56:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:51,722 INFO L225 Difference]: With dead ends: 1586 [2023-12-02 12:56:51,723 INFO L226 Difference]: Without dead ends: 1584 [2023-12-02 12:56:51,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:56:51,723 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 4 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:51,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3670 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 12:56:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2023-12-02 12:56:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2023-12-02 12:56:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1047 states have (on average 2.018147086914995) internal successors, (2113), 1540 states have internal predecessors, (2113), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 12:56:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2188 transitions. [2023-12-02 12:56:51,741 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2188 transitions. Word has length 76 [2023-12-02 12:56:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:51,741 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2188 transitions. [2023-12-02 12:56:51,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 12:56:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2188 transitions. [2023-12-02 12:56:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 12:56:51,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:51,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:56:51,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-02 12:56:51,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:51,942 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:51,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash -128198608, now seen corresponding path program 1 times [2023-12-02 12:56:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:51,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538453804] [2023-12-02 12:56:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:51,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:56:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:51,944 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:51,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-02 12:56:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:52,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:56:52,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:52,319 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 12:56:52,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:56:52,448 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 12:56:52,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538453804] [2023-12-02 12:56:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538453804] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:56:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [266868484] [2023-12-02 12:56:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:56:52,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:56:52,451 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:56:52,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 12:56:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:53,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:56:53,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:53,028 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 12:56:53,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:56:53,082 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 12:56:53,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [266868484] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:56:53,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751953255] [2023-12-02 12:56:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:56:53,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:56:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:56:53,084 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:56:53,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 12:56:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:56:53,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:56:53,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:53,420 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 12:56:53,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:56:53,470 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 12:56:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751953255] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:56:53,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 12:56:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2023-12-02 12:56:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748689776] [2023-12-02 12:56:53,471 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 12:56:53,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 12:56:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:56:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 12:56:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 12:56:53,473 INFO L87 Difference]: Start difference. First operand 1584 states and 2188 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 12:56:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:56:55,105 INFO L93 Difference]: Finished difference Result 1598 states and 2206 transitions. [2023-12-02 12:56:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 12:56:55,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-12-02 12:56:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:56:55,110 INFO L225 Difference]: With dead ends: 1598 [2023-12-02 12:56:55,110 INFO L226 Difference]: Without dead ends: 1594 [2023-12-02 12:56:55,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-12-02 12:56:55,111 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 24 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3671 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:56:55,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3671 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 12:56:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2023-12-02 12:56:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1592. [2023-12-02 12:56:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1055 states have (on average 2.0123222748815164) internal successors, (2123), 1548 states have internal predecessors, (2123), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 12:56:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2198 transitions. [2023-12-02 12:56:55,135 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2198 transitions. Word has length 77 [2023-12-02 12:56:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:56:55,136 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 2198 transitions. [2023-12-02 12:56:55,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 12:56:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2198 transitions. [2023-12-02 12:56:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 12:56:55,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:56:55,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:56:55,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 12:56:55,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-12-02 12:56:55,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-02 12:56:55,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 12:56:55,738 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:56:55,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:56:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1332660072, now seen corresponding path program 2 times [2023-12-02 12:56:55,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:56:55,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942305913] [2023-12-02 12:56:55,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:56:55,739 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 12:56:55,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:56:55,740 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:56:55,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 12:56:56,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:56:56,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:56:56,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:56:56,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:56,428 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 12:56:56,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:56:56,748 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 12:56:56,748 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:56:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942305913] [2023-12-02 12:56:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942305913] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:56:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1172535672] [2023-12-02 12:56:56,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:56:56,749 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:56:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:56:56,749 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:56:56,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 12:56:58,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:56:58,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:56:58,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:56:58,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:56:58,756 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 12:56:58,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:56:58,843 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 12:56:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1172535672] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:56:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834969963] [2023-12-02 12:56:58,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:56:58,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:56:58,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:56:58,844 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:56:58,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 12:57:57,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:57:57,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:57:57,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 12:57:57,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:57:58,025 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:57:58,025 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 12:57:58,069 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 12:57:58,497 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 12:57:58,498 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 12:57:58,571 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 12:57:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:57:58,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:57:58,739 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 12:57:58,740 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 12:57:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834969963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:57:58,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 12:57:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2023-12-02 12:57:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285804120] [2023-12-02 12:57:58,871 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 12:57:58,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 12:57:58,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:57:58,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 12:57:58,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=799, Unknown=13, NotChecked=0, Total=930 [2023-12-02 12:57:58,873 INFO L87 Difference]: Start difference. First operand 1592 states and 2198 transitions. Second operand has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 12:58:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:15,946 INFO L93 Difference]: Finished difference Result 2001 states and 2746 transitions. [2023-12-02 12:58:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 12:58:15,947 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 80 [2023-12-02 12:58:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:15,949 INFO L225 Difference]: With dead ends: 2001 [2023-12-02 12:58:15,949 INFO L226 Difference]: Without dead ends: 1997 [2023-12-02 12:58:15,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=622, Invalid=3271, Unknown=13, NotChecked=0, Total=3906 [2023-12-02 12:58:15,951 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 783 mSDsluCounter, 9104 mSDsCounter, 0 mSdLazyCounter, 9747 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 9675 SdHoareTripleChecker+Invalid, 9805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 9747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:15,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 9675 Invalid, 9805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 9747 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2023-12-02 12:58:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2023-12-02 12:58:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1609. [2023-12-02 12:58:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1073 states have (on average 1.9990680335507922) internal successors, (2145), 1565 states have internal predecessors, (2145), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 12:58:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2220 transitions. [2023-12-02 12:58:15,969 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2220 transitions. Word has length 80 [2023-12-02 12:58:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:15,969 INFO L495 AbstractCegarLoop]: Abstraction has 1609 states and 2220 transitions. [2023-12-02 12:58:15,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 12:58:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2220 transitions. [2023-12-02 12:58:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 12:58:15,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:15,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:58:16,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-12-02 12:58:16,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 12:58:16,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 12:58:16,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:58:16,571 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:58:16,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -115633559, now seen corresponding path program 1 times [2023-12-02 12:58:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:58:16,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371151807] [2023-12-02 12:58:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:16,572 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 12:58:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:58:16,573 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:58:16,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-02 12:58:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:16,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 12:58:16,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:17,161 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 12:58:17,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:17,937 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 12:58:17,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:58:17,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371151807] [2023-12-02 12:58:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371151807] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [91879849] [2023-12-02 12:58:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:17,938 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:58:17,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:58:17,939 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:58:17,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 12:58:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:18,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 12:58:18,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:18,694 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 12:58:18,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:18,864 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 12:58:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [91879849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749338274] [2023-12-02 12:58:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:18,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:18,865 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:18,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 12:58:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:19,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 12:58:19,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:19,466 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 12:58:19,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:21,030 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 12:58:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749338274] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:21,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 12:58:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2023-12-02 12:58:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942921140] [2023-12-02 12:58:21,031 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:21,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 12:58:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:58:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 12:58:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 12:58:21,034 INFO L87 Difference]: Start difference. First operand 1609 states and 2220 transitions. Second operand has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 12:58:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:32,457 INFO L93 Difference]: Finished difference Result 1653 states and 2294 transitions. [2023-12-02 12:58:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 12:58:32,458 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2023-12-02 12:58:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:32,461 INFO L225 Difference]: With dead ends: 1653 [2023-12-02 12:58:32,461 INFO L226 Difference]: Without dead ends: 1647 [2023-12-02 12:58:32,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1295, Invalid=2737, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 12:58:32,462 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 40 mSDsluCounter, 18304 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19224 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:32,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19224 Invalid, 2831 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-12-02 12:58:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2023-12-02 12:58:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1645. [2023-12-02 12:58:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1109 states have (on average 1.975653742110009) internal successors, (2191), 1601 states have internal predecessors, (2191), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 12:58:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2266 transitions. [2023-12-02 12:58:32,477 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2266 transitions. Word has length 86 [2023-12-02 12:58:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:32,478 INFO L495 AbstractCegarLoop]: Abstraction has 1645 states and 2266 transitions. [2023-12-02 12:58:32,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 12:58:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2266 transitions. [2023-12-02 12:58:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 12:58:32,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:32,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:58:32,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-12-02 12:58:32,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 12:58:32,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-12-02 12:58:33,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 12:58:33,080 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 12:58:33,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1332189079, now seen corresponding path program 2 times [2023-12-02 12:58:33,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:58:33,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288673446] [2023-12-02 12:58:33,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:58:33,081 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 12:58:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:58:33,081 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 12:58:33,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Waiting until timeout for monitored process [2023-12-02 12:58:33,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:58:33,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:58:33,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 12:58:33,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:34,375 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 12:58:34,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:36,512 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 12:58:36,512 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:58:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288673446] [2023-12-02 12:58:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288673446] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:36,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2129310555] [2023-12-02 12:58:36,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:58:36,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 12:58:36,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 12:58:36,513 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 12:58:36,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 12:58:38,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 12:58:38,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:58:38,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 12:58:38,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:38,857 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 12:58:38,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:39,211 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 12:58:39,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2129310555] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:39,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907173063] [2023-12-02 12:58:39,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:58:39,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:39,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:39,213 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:39,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 13:01:03,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:01:03,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:01:03,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 13:01:03,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:03,395 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 13:01:03,481 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:01:03,481 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 13:01:03,579 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 13:01:03,590 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 13:01:03,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 13:01:03,918 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 13:01:04,970 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:01:04,971 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 13:01:04,984 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 13:01:05,193 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 13:01:05,199 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 13:01:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-02 13:01:05,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:06,283 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3737 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:01:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907173063] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:06,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 13:01:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2023-12-02 13:01:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945888520] [2023-12-02 13:01:06,289 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 13:01:06,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-02 13:01:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:01:06,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-02 13:01:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3528, Unknown=1, NotChecked=128, Total=4422 [2023-12-02 13:01:06,292 INFO L87 Difference]: Start difference. First operand 1645 states and 2266 transitions. Second operand has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:02:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:02:01,962 INFO L93 Difference]: Finished difference Result 2102 states and 2912 transitions. [2023-12-02 13:02:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-02 13:02:01,963 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 98 [2023-12-02 13:02:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:02:01,966 INFO L225 Difference]: With dead ends: 2102 [2023-12-02 13:02:01,966 INFO L226 Difference]: Without dead ends: 2098 [2023-12-02 13:02:01,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4790 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=3579, Invalid=17304, Unknown=1, NotChecked=286, Total=21170 [2023-12-02 13:02:01,978 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 972 mSDsluCounter, 17608 mSDsCounter, 0 mSdLazyCounter, 20538 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 18188 SdHoareTripleChecker+Invalid, 20635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 20538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:02:01,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 18188 Invalid, 20635 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [97 Valid, 20538 Invalid, 0 Unknown, 0 Unchecked, 41.6s Time] [2023-12-02 13:02:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2023-12-02 13:02:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1712. [2023-12-02 13:02:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1177 states have (on average 1.9379779099405268) internal successors, (2281), 1668 states have internal predecessors, (2281), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 13:02:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2356 transitions. [2023-12-02 13:02:01,997 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2356 transitions. Word has length 98 [2023-12-02 13:02:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:02:01,998 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2356 transitions. [2023-12-02 13:02:01,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:02:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2356 transitions. [2023-12-02 13:02:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 13:02:01,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:02:01,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:02:02,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 13:02:02,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Ended with exit code 0 [2023-12-02 13:02:02,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 13:02:02,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:02,600 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 13:02:02,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:02:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2025310281, now seen corresponding path program 1 times [2023-12-02 13:02:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:02:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495398354] [2023-12-02 13:02:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:02,601 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 13:02:02,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:02:02,602 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:02:02,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-02 13:02:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:03,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 13:02:03,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:03,514 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 13:02:03,653 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:02:03,653 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 13:02:03,694 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 13:02:03,794 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 13:02:04,914 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:02:04,914 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 13:02:05,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:02:05,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 44 treesize of output 43 [2023-12-02 13:02:05,049 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 13:02:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:02:05,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:05,164 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4177) |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 13:02:07,666 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4177 (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~mem73#1.base| v_ArrVal_4223))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4177)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:02:07,669 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:02:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495398354] [2023-12-02 13:02:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495398354] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483609173] [2023-12-02 13:02:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:07,669 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:02:07,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:02:07,670 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:02:07,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 13:02:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:13,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 13:02:13,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:13,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 13:02:13,888 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:02:13,889 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 13:02:13,972 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 13:02:14,152 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 20 treesize of output 12 [2023-12-02 13:02:15,243 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:02:15,244 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 36 treesize of output 35 [2023-12-02 13:02:15,453 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:02:15,453 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 36 treesize of output 35 [2023-12-02 13:02:15,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 13:02:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:02:15,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:15,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4663) |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 13:02:15,505 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (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_4663) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 13:02:15,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4709 (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~mem73#1.base| v_ArrVal_4709))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4663)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:02:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1483609173] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187246849] [2023-12-02 13:02:15,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:02:15,968 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:02:15,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 13:02:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:16,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:02:16,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:16,756 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:02:16,757 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 13:02:16,805 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 13:02:17,823 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:02:17,824 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 13:02:20,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:02:20,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 13:02:20,023 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 13:02:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:02:20,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:20,045 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5147 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5147) |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 13:02:20,058 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5147 (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_5147) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:02:20,558 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 13:02:20,558 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 13:02:20,569 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5147 (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~mem73#1.base| v_ArrVal_5193))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5147)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2023-12-02 13:02:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187246849] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:20,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:02:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 30 [2023-12-02 13:02:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218175154] [2023-12-02 13:02:20,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:02:20,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 13:02:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:02:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 13:02:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=921, Unknown=11, NotChecked=552, Total=1640 [2023-12-02 13:02:20,574 INFO L87 Difference]: Start difference. First operand 1712 states and 2356 transitions. Second operand has 31 states, 25 states have (on average 6.12) internal successors, (153), 26 states have internal predecessors, (153), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:02:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:02:39,263 INFO L93 Difference]: Finished difference Result 2095 states and 2862 transitions. [2023-12-02 13:02:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 13:02:39,264 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 6.12) internal successors, (153), 26 states have internal predecessors, (153), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 122 [2023-12-02 13:02:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:02:39,267 INFO L225 Difference]: With dead ends: 2095 [2023-12-02 13:02:39,267 INFO L226 Difference]: Without dead ends: 2095 [2023-12-02 13:02:39,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 340 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=256, Invalid=1657, Unknown=11, NotChecked=728, Total=2652 [2023-12-02 13:02:39,269 INFO L413 NwaCegarLoop]: 558 mSDtfsCounter, 762 mSDsluCounter, 7629 mSDsCounter, 0 mSdLazyCounter, 9525 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 8187 SdHoareTripleChecker+Invalid, 9577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 9525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:02:39,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 8187 Invalid, 9577 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 9525 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2023-12-02 13:02:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2023-12-02 13:02:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1709. [2023-12-02 13:02:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1177 states have (on average 1.9328802039082413) internal successors, (2275), 1665 states have internal predecessors, (2275), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 13:02:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2350 transitions. [2023-12-02 13:02:39,292 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2350 transitions. Word has length 122 [2023-12-02 13:02:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:02:39,292 INFO L495 AbstractCegarLoop]: Abstraction has 1709 states and 2350 transitions. [2023-12-02 13:02:39,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 6.12) internal successors, (153), 26 states have internal predecessors, (153), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:02:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2350 transitions. [2023-12-02 13:02:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 13:02:39,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:02:39,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:02:39,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-12-02 13:02:39,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-12-02 13:02:39,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-12-02 13:02:39,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:02:39,894 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 13:02:39,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:02:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2025310280, now seen corresponding path program 1 times [2023-12-02 13:02:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:02:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479980137] [2023-12-02 13:02:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:39,896 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 13:02:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:02:39,896 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:02:39,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-02 13:02:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:40,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-02 13:02:40,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:40,954 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 13:02:41,254 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 13:02:41,297 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:02:41,298 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 13:02:41,344 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 13:02:41,357 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 13:02:41,480 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 13:02:41,485 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 13:02:42,614 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:02:42,614 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 13:02:42,630 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 13:02:42,768 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:02:42,769 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 13:02:42,780 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 13:02:42,796 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 13:02:42,803 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 13:02:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:02:42,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:43,022 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5680) |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~mem74#1.base| v_ArrVal_5679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:02:43,058 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_5680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:02:44,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5771 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5772 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5772) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5771) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5771 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5772 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5771))) (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~mem73#1.base| v_ArrVal_5772) .cse2 v_ArrVal_5680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:02:44,420 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:02:44,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479980137] [2023-12-02 13:02:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479980137] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:44,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1159976128] [2023-12-02 13:02:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:44,421 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:02:44,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:02:44,421 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:02:44,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 13:02:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:49,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-02 13:02:49,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:49,107 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 13:02:49,115 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 13:02:49,787 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:02:49,787 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 13:02:49,794 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 12 treesize of output 14 [2023-12-02 13:02:49,901 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 15 treesize of output 1 [2023-12-02 13:02:49,906 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 13:02:50,020 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 17 treesize of output 9 [2023-12-02 13:02:50,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 7 treesize of output 3 [2023-12-02 13:02:51,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:02:51,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:02:51,398 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2023-12-02 13:02:51,405 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 35 treesize of output 11 [2023-12-02 13:02:51,554 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 17 treesize of output 9 [2023-12-02 13:02:51,558 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 7 treesize of output 3 [2023-12-02 13:02:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:02:51,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:52,080 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 231 treesize of output 159 [2023-12-02 13:02:54,907 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_ArrVal_6264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6264))) (let ((.cse1 (select |c_#length| v_arrayElimCell_71)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (forall ((v_ArrVal_6217 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv8 32) (select (select (store .cse3 v_arrayElimCell_71 (store (select .cse3 v_arrayElimCell_71) (bvadd (_ bv16 32) .cse0) v_ArrVal_6217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_6218 (_ BitVec 32))) (bvule .cse2 (select |c_#length| v_ArrVal_6218))) (bvule .cse2 .cse1)))))))) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_ArrVal_6264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6264))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd .cse5 (_ bv20 32)) (select |c_#length| v_arrayElimCell_71))) (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse6 (select (select (store .cse7 v_arrayElimCell_71 (store (select .cse7 v_arrayElimCell_71) (bvadd (_ bv16 32) .cse5) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse6) (bvadd (_ bv8 32) .cse6)))))))) (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_ArrVal_6264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6264))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse9 (select |c_#length| v_arrayElimCell_71))) (or (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_71) (not (bvule (bvadd .cse8 (_ bv20 32)) .cse9)) (forall ((v_ArrVal_6217 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store .cse10 v_arrayElimCell_71 (store (select .cse10 v_arrayElimCell_71) (bvadd (_ bv16 32) .cse8) v_ArrVal_6217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) .cse9)))))) (forall ((v_ArrVal_6264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6264))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_arrayElimCell_71 (_ BitVec 32)) (v_ArrVal_6217 (_ BitVec 32))) (let ((.cse12 (select |c_#length| v_arrayElimCell_71))) (or (not (bvule (bvadd .cse11 (_ bv20 32)) .cse12)) (bvule (bvadd (_ bv8 32) (select (select (store .cse13 v_arrayElimCell_71 (store (select .cse13 v_arrayElimCell_71) (bvadd (_ bv16 32) .cse11) v_ArrVal_6217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) .cse12)))) (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse11)))))) (forall ((v_ArrVal_6264 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6264) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse15 (select .cse14 .cse4))) (or (forall ((v_ArrVal_6218 (_ BitVec 32)) (v_ArrVal_6217 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (store .cse14 (bvadd (_ bv16 32) .cse15) v_ArrVal_6217) .cse4)) (select |c_#length| v_ArrVal_6218))) (not (bvule (bvadd .cse15 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))) (not (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse15))))))))) is different from false [2023-12-02 13:02:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1159976128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303550308] [2023-12-02 13:02:55,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:55,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:02:55,161 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:02:55,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 13:02:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:55,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 121 conjunts are in the unsatisfiable core [2023-12-02 13:02:55,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:55,829 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 13:02:56,061 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 13:02:56,085 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:02:56,086 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 13:02:56,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 13:02:56,261 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 13:02:56,598 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 13:02:56,603 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 13:02:57,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:02:57,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 13:02:57,565 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 13:02:57,934 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:02:57,934 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 13:02:57,940 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 13:02:57,960 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 13:02:57,968 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 13:02:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:02:57,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:58,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6750) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-12-02 13:02:58,072 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_6750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6750) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6751) |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 13:02:59,504 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6842))) (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~mem73#1.base| v_ArrVal_6843) .cse0 v_ArrVal_6751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6750) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6843) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6842) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6751) |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 13:02:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303550308] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:59,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:02:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 34 [2023-12-02 13:02:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725686674] [2023-12-02 13:02:59,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:02:59,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 13:02:59,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:02:59,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 13:02:59,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1355, Unknown=7, NotChecked=560, Total=2070 [2023-12-02 13:02:59,516 INFO L87 Difference]: Start difference. First operand 1709 states and 2350 transitions. Second operand has 35 states, 29 states have (on average 6.931034482758621) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 13:03:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:43,257 INFO L93 Difference]: Finished difference Result 2611 states and 3575 transitions. [2023-12-02 13:03:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:03:43,257 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 6.931034482758621) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 122 [2023-12-02 13:03:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:43,260 INFO L225 Difference]: With dead ends: 2611 [2023-12-02 13:03:43,260 INFO L226 Difference]: Without dead ends: 2611 [2023-12-02 13:03:43,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=248, Invalid=1935, Unknown=7, NotChecked=672, Total=2862 [2023-12-02 13:03:43,262 INFO L413 NwaCegarLoop]: 672 mSDtfsCounter, 1634 mSDsluCounter, 7182 mSDsCounter, 0 mSdLazyCounter, 18328 mSolverCounterSat, 57 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 7854 SdHoareTripleChecker+Invalid, 18390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 18328 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:43,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 7854 Invalid, 18390 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 18328 Invalid, 5 Unknown, 0 Unchecked, 42.5s Time] [2023-12-02 13:03:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2023-12-02 13:03:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1708. [2023-12-02 13:03:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1177 states have (on average 1.9311809685641461) internal successors, (2273), 1664 states have internal predecessors, (2273), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 13:03:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2348 transitions. [2023-12-02 13:03:43,279 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2348 transitions. Word has length 122 [2023-12-02 13:03:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:43,280 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 2348 transitions. [2023-12-02 13:03:43,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 6.931034482758621) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 13:03:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2348 transitions. [2023-12-02 13:03:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 13:03:43,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:43,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:03:43,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-02 13:03:43,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 13:03:43,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 13:03:43,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:43,882 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 13:03:43,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash -701347231, now seen corresponding path program 1 times [2023-12-02 13:03:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:03:43,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554846855] [2023-12-02 13:03:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:43,883 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 13:03:43,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:03:43,883 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:03:43,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-02 13:03:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:44,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 13:03:44,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:44,975 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 13:03:45,152 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:03:45,153 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 13:03:45,184 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 13:03:45,297 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 13:03:46,628 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:03:46,629 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 13:03:46,770 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:03:46,771 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 13:03:46,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:03:46,874 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 13:03:46,888 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 13:03:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:03:46,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:03:47,017 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7299) |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 13:03:47,029 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (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_7299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:03:47,044 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7299 (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~mem74#1.base| v_ArrVal_7298))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7299)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:03:47,058 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7299 (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_7298))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7299)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:03:47,467 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7345))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7298)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7299)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:03:47,470 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:03:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554846855] [2023-12-02 13:03:47,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554846855] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:47,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1444247223] [2023-12-02 13:03:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:47,471 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:03:47,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:03:47,472 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:03:47,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-12-02 13:03:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:54,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 13:03:54,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:54,661 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 13:03:55,028 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:03:55,028 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 13:03:55,113 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 13:03:55,300 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 20 treesize of output 12 [2023-12-02 13:03:56,402 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:03:56,403 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 36 treesize of output 35 [2023-12-02 13:03:56,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:03:56,586 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 36 treesize of output 35 [2023-12-02 13:03:56,702 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:03:56,702 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 36 treesize of output 35 [2023-12-02 13:03:56,714 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 27 treesize of output 15 [2023-12-02 13:03:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:03:56,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:03:56,735 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7801 (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~mem75#1.base| v_ArrVal_7801) |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 13:03:56,745 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7801 (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_7801) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:03:56,758 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7800 (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~mem74#1.base| v_ArrVal_7800))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7801)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:03:56,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7800 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7800))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7801)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:03:57,152 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7800 (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~mem73#1.base| v_ArrVal_7847))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7800)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7801)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:03:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1444247223] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754117774] [2023-12-02 13:03:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:57,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:03:57,157 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:03:57,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 13:03:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:57,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 13:03:57,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:58,035 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:03:58,035 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 13:03:58,080 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 13:03:58,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:03:58,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 13:03:58,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:03:58,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 13:03:58,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:03:58,971 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 13:03:59,047 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 13:03:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:03:59,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:03:59,072 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:03:59,072 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 13:03:59,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8301 (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_8301) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 13:03:59,218 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8300)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8301) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 13:03:59,230 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8300))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8301) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 13:03:59,692 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8300 (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~mem73#1.base| v_ArrVal_8347))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8300)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8301) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 13:03:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754117774] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:59,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:03:59,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 32 [2023-12-02 13:03:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525302740] [2023-12-02 13:03:59,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:03:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 13:03:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:03:59,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 13:03:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1032, Unknown=28, NotChecked=1106, Total=2352 [2023-12-02 13:03:59,697 INFO L87 Difference]: Start difference. First operand 1708 states and 2348 transitions. Second operand has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:04:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:04:15,119 INFO L93 Difference]: Finished difference Result 2093 states and 2858 transitions. [2023-12-02 13:04:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 13:04:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 124 [2023-12-02 13:04:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:04:15,123 INFO L225 Difference]: With dead ends: 2093 [2023-12-02 13:04:15,123 INFO L226 Difference]: Without dead ends: 2093 [2023-12-02 13:04:15,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 344 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=267, Invalid=1653, Unknown=28, NotChecked=1358, Total=3306 [2023-12-02 13:04:15,124 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1389 mSDsluCounter, 6341 mSDsCounter, 0 mSdLazyCounter, 7854 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 6898 SdHoareTripleChecker+Invalid, 7907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 7854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:04:15,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 6898 Invalid, 7907 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 7854 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2023-12-02 13:04:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2023-12-02 13:04:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1707. [2023-12-02 13:04:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1177 states have (on average 1.929481733220051) internal successors, (2271), 1663 states have internal predecessors, (2271), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 13:04:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2346 transitions. [2023-12-02 13:04:15,140 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2346 transitions. Word has length 124 [2023-12-02 13:04:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:04:15,140 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2346 transitions. [2023-12-02 13:04:15,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:04:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2346 transitions. [2023-12-02 13:04:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 13:04:15,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:04:15,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:04:15,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-12-02 13:04:15,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2023-12-02 13:04:15,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-12-02 13:04:15,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:04:15,742 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 13:04:15,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:04:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash -701347230, now seen corresponding path program 1 times [2023-12-02 13:04:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:04:15,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741888472] [2023-12-02 13:04:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:04:15,743 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 13:04:15,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:04:15,744 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:04:15,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-02 13:04:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:04:16,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-02 13:04:16,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:04:16,922 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 13:04:17,045 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 13:04:17,076 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:04:17,077 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 13:04:17,108 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 13:04:17,133 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 13:04:17,239 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 13:04:17,243 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 13:04:18,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:04:18,241 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 13:04:18,253 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 13:04:18,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:04:18,391 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 13:04:18,402 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 13:04:18,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:04:18,490 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 13:04:18,500 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 13:04:18,511 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 13:04:18,517 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 13:04:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:04:18,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:04:18,748 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8850) |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~mem75#1.base| v_ArrVal_8851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8850) |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 13:04:18,779 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_8851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8850) |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 13:04:18,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8849))) (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~mem74#1.base| v_ArrVal_8848) .cse0 v_ArrVal_8850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8848) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8850) |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 13:04:19,125 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_8849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8848) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8849))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8848) .cse3 v_ArrVal_8850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 13:04:21,102 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8943))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8849))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8942) .cse0 v_ArrVal_8848) .cse1 v_ArrVal_8850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8943))) (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~mem73#1.base| v_ArrVal_8942) .cse6 v_ArrVal_8848) (select (select (store .cse7 .cse6 v_ArrVal_8849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8850))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2023-12-02 13:04:21,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:04:21,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741888472] [2023-12-02 13:04:21,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741888472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:04:21,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1025388612] [2023-12-02 13:04:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:04:21,121 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:04:21,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:04:21,122 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:04:21,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-12-02 13:06:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:06:20,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 126 conjunts are in the unsatisfiable core [2023-12-02 13:06:20,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:06:20,241 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 13:06:20,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:06:20,939 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:06:20,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 13:06:21,061 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 13:06:21,083 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 13:06:21,406 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 13:06:21,413 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 13:06:22,858 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:06:22,858 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 13:06:22,865 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 13:06:23,189 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:06:23,190 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 13:06:23,216 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 13:06:23,413 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:06:23,413 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 13:06:23,430 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 13:06:23,450 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 13:06:23,461 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 13:06:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:06:23,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:06:23,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9446) |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~mem75#1.base| v_ArrVal_9447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9446) |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 13:06:23,585 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_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:06:23,727 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9445) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9444))) (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~mem74#1.base| v_ArrVal_9445) .cse2 v_ArrVal_9446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:06:23,807 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_9447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9444))) (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_9445) .cse1 v_ArrVal_9446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9445) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9446) |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 13:06:26,050 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9538))) (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~mem73#1.base| v_ArrVal_9539) .cse1 v_ArrVal_9445) (select (select (store .cse2 .cse1 v_ArrVal_9444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9446))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9538))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9444))) (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~mem73#1.base| v_ArrVal_9539) .cse4 v_ArrVal_9445) .cse5 v_ArrVal_9446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:06:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1025388612] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:06:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881994189] [2023-12-02 13:06:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:06:26,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:06:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:06:26,070 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:06:26,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-12-02 13:06:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:06:26,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 123 conjunts are in the unsatisfiable core [2023-12-02 13:06:26,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:06:27,155 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 13:06:27,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:06:27,199 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 13:06:27,237 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 13:06:27,245 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 13:06:27,352 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 13:06:27,360 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 13:06:28,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:28,979 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 13:06:29,001 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 13:06:29,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:29,152 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 13:06:29,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 13:06:29,252 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:29,252 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 13:06:29,274 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 13:06:29,294 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 13:06:29,307 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 13:06:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:06:29,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:06:29,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10042 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10041) |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~mem75#1.base| v_ArrVal_10042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10041) |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 13:06:29,432 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_10041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10042 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:06:29,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10039))) (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~mem74#1.base| v_ArrVal_10040) .cse0 v_ArrVal_10041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10040) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10041) |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 13:06:29,547 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_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10039))) (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_10040) .cse1 v_ArrVal_10041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10040) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10041) |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 13:06:31,406 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10133))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10039))) (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~mem73#1.base| v_ArrVal_10134) .cse0 v_ArrVal_10040) .cse1 v_ArrVal_10041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10133))) (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~mem73#1.base| v_ArrVal_10134) .cse6 v_ArrVal_10040) (select (select (store .cse7 .cse6 v_ArrVal_10039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10041))) |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 13:06:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881994189] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:06:31,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:06:31,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2023-12-02 13:06:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252042017] [2023-12-02 13:06:31,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:06:31,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 13:06:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:06:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 13:06:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=492, Unknown=15, NotChecked=870, Total=1482 [2023-12-02 13:06:31,425 INFO L87 Difference]: Start difference. First operand 1707 states and 2346 transitions. Second operand has 22 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 13:07:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:07:19,715 INFO L93 Difference]: Finished difference Result 2609 states and 3571 transitions. [2023-12-02 13:07:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 13:07:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-12-02 13:07:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:07:19,718 INFO L225 Difference]: With dead ends: 2609 [2023-12-02 13:07:19,718 INFO L226 Difference]: Without dead ends: 2609 [2023-12-02 13:07:19,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 351 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=178, Invalid=923, Unknown=15, NotChecked=1140, Total=2256 [2023-12-02 13:07:19,720 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1180 mSDsluCounter, 5361 mSDsCounter, 0 mSdLazyCounter, 12472 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 6155 SdHoareTripleChecker+Invalid, 12502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:07:19,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 6155 Invalid, 12502 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [30 Valid, 12472 Invalid, 0 Unknown, 0 Unchecked, 47.2s Time] [2023-12-02 13:07:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2023-12-02 13:07:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1706. [2023-12-02 13:07:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1177 states have (on average 1.927782497875956) internal successors, (2269), 1662 states have internal predecessors, (2269), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 13:07:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2344 transitions. [2023-12-02 13:07:19,738 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2344 transitions. Word has length 124 [2023-12-02 13:07:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:07:19,738 INFO L495 AbstractCegarLoop]: Abstraction has 1706 states and 2344 transitions. [2023-12-02 13:07:19,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 13:07:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2344 transitions. [2023-12-02 13:07:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 13:07:19,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:07:19,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:07:19,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Ended with exit code 0 [2023-12-02 13:07:19,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2023-12-02 13:07:20,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Ended with exit code 0 [2023-12-02 13:07:20,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:07:20,340 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 13:07:20,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:07:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash 316818661, now seen corresponding path program 1 times [2023-12-02 13:07:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:07:20,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413127940] [2023-12-02 13:07:20,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:07:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:07:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:07:20,342 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:07:20,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-02 13:07:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:07:21,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 13:07:21,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:07:21,572 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 13:07:21,924 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:07:21,924 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 13:07:22,002 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 13:07:22,188 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 13:07:24,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:24,303 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 13:07:24,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:24,548 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 13:07:24,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:24,727 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 13:07:24,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:24,907 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 13:07:24,934 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 13:07:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:07:25,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:07:27,343 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10606 (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_10606) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 13:07:27,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10606 (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~mem75#1.base| v_ArrVal_10605))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10606)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:07:27,395 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10606 (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_10605))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10606)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:07:27,425 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10604))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10605)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10606)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:07:27,459 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10604 (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_10604))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10605)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10606)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:07:28,146 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10604 (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~mem73#1.base| v_ArrVal_10652))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10604)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10605)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10606)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:07:28,153 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:07:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413127940] [2023-12-02 13:07:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413127940] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:07:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1932641405] [2023-12-02 13:07:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:07:28,153 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:07:28,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:07:28,154 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:07:28,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-12-02 13:07:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:07:37,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 13:07:37,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:07:38,003 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 13:07:38,692 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:07:38,692 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 13:07:38,850 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 13:07:39,195 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 20 treesize of output 12 [2023-12-02 13:07:41,096 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:07:41,097 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 36 treesize of output 35 [2023-12-02 13:07:41,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:07:41,467 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 36 treesize of output 35 [2023-12-02 13:07:41,706 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:07:41,706 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 36 treesize of output 35 [2023-12-02 13:07:41,928 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:07:41,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:07:41,965 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 27 treesize of output 15 [2023-12-02 13:07:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:07:41,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:07:42,011 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11124 (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~mem76#1.base| v_ArrVal_11124) |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 13:07:42,032 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11124 (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_11124) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:07:42,056 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11124 (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~mem75#1.base| v_ArrVal_11123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11124)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:07:42,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11124 (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_11123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11124)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:07:42,107 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11122))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11123)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11124)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:07:42,135 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11122))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11123)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11124)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:07:42,774 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11170))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11122)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11123)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11124)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:07:42,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1932641405] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:07:42,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308081473] [2023-12-02 13:07:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:07:42,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:07:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:07:42,782 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:07:42,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-12-02 13:07:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:07:43,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 13:07:43,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:07:43,991 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:07:43,992 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 13:07:44,101 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 13:07:45,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:45,476 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 13:07:45,668 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:45,668 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 13:07:45,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:45,860 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 13:07:46,066 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:07:46,066 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 13:07:46,229 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 13:07:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:07:46,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:07:46,279 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:07:46,280 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 13:07:46,293 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem76#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_11640) |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 13:07:46,310 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11640 (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_11640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 13:07:46,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11639)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 13:07:46,350 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (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_11639))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_11640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 13:07:46,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (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~mem74#1.base| v_ArrVal_11638))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11639)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 13:07:46,397 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11638))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11639)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 13:07:47,061 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11638 (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~mem73#1.base| v_ArrVal_11686))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11638)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11639)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 13:07:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308081473] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:07:47,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:07:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 35 [2023-12-02 13:07:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684798825] [2023-12-02 13:07:47,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:07:47,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 13:07:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:07:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 13:07:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1242, Unknown=25, NotChecked=1820, Total=3306 [2023-12-02 13:07:47,070 INFO L87 Difference]: Start difference. First operand 1706 states and 2344 transitions. Second operand has 36 states, 30 states have (on average 5.5) internal successors, (165), 31 states have internal predecessors, (165), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:08:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:08:14,248 INFO L93 Difference]: Finished difference Result 2091 states and 2854 transitions. [2023-12-02 13:08:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 13:08:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 5.5) internal successors, (165), 31 states have internal predecessors, (165), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 126 [2023-12-02 13:08:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:08:14,252 INFO L225 Difference]: With dead ends: 2091 [2023-12-02 13:08:14,252 INFO L226 Difference]: Without dead ends: 2091 [2023-12-02 13:08:14,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 347 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=300, Invalid=1917, Unknown=25, NotChecked=2180, Total=4422 [2023-12-02 13:08:14,254 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 1387 mSDsluCounter, 5996 mSDsCounter, 0 mSdLazyCounter, 7482 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 6552 SdHoareTripleChecker+Invalid, 7534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 7482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:08:14,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 6552 Invalid, 7534 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 7482 Invalid, 0 Unknown, 0 Unchecked, 26.3s Time] [2023-12-02 13:08:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2023-12-02 13:08:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1705. [2023-12-02 13:08:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1177 states have (on average 1.9260832625318607) internal successors, (2267), 1661 states have internal predecessors, (2267), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-12-02 13:08:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2342 transitions. [2023-12-02 13:08:14,274 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2342 transitions. Word has length 126 [2023-12-02 13:08:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:08:14,275 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 2342 transitions. [2023-12-02 13:08:14,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 5.5) internal successors, (165), 31 states have internal predecessors, (165), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:08:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2342 transitions. [2023-12-02 13:08:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 13:08:14,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:08:14,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:08:14,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2023-12-02 13:08:14,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2023-12-02 13:08:14,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2023-12-02 13:08:14,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:08:14,877 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-12-02 13:08:14,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:08:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash 316818662, now seen corresponding path program 1 times [2023-12-02 13:08:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:08:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618927833] [2023-12-02 13:08:14,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:08:14,878 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 13:08:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:08:14,879 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 13:08:14,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2023-12-02 13:08:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:08:16,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 129 conjunts are in the unsatisfiable core [2023-12-02 13:08:16,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:08:16,306 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 13:08:16,948 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 13:08:17,013 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:08:17,013 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 13:08:17,090 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 13:08:17,114 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 13:08:17,344 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 13:08:17,352 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 13:08:19,163 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:08:19,163 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 13:08:19,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 13:08:19,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:08:19,436 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 13:08:19,455 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 13:08:19,641 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:08:19,642 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 13:08:19,649 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 13:08:19,840 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:08:19,840 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 13:08:19,853 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 13:08:19,886 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 13:08:19,894 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 13:08:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:08:19,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:08:20,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:08:20,355 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_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:08:20,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12205) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12204))) (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~mem75#1.base| v_ArrVal_12205) .cse2 v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:08:20,483 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_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12204))) (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_12205) .cse1 v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12205) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12206) |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 13:08:21,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12203))) (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~mem74#1.base| v_ArrVal_12202) .cse1 v_ArrVal_12205) (select (select (store .cse2 .cse1 v_ArrVal_12204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12206))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12203))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12204))) (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~mem74#1.base| v_ArrVal_12202) .cse4 v_ArrVal_12205) .cse5 v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:08:23,145 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12203))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12204))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12202) .cse1 v_ArrVal_12205) .cse2 v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12203))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12202) .cse7 v_ArrVal_12205) (select (select (store .cse8 .cse7 v_ArrVal_12204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12206))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-12-02 13:08:27,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12299))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12203))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12204))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12298) .cse0 v_ArrVal_12202) .cse1 v_ArrVal_12205) .cse2 v_ArrVal_12206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12299))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12203))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12298) .cse8 v_ArrVal_12202) .cse9 v_ArrVal_12205) (select (select (store .cse10 .cse9 v_ArrVal_12204) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12206))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 13:08:27,203 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:08:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618927833] [2023-12-02 13:08:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618927833] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:08:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1034083927] [2023-12-02 13:08:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:08:27,203 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:08:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:08:27,204 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:08:27,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee6766e7-24ea-40f5-a1be-22989da8ef05/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process