./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/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_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/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_b70a0178-67a9-4fa8-8fff-908acb484ce7/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 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:28:28,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:28:28,471 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 08:28:28,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:28:28,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:28:28,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:28:28,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:28:28,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:28:28,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:28:28,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:28:28,499 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:28:28,500 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:28:28,500 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:28:28,501 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:28:28,501 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:28:28,502 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:28:28,502 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:28:28,503 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:28:28,503 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:28:28,504 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:28:28,504 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:28:28,505 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:28:28,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 08:28:28,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 08:28:28,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:28:28,507 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:28:28,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:28:28,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:28:28,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:28:28,509 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 08:28:28,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 08:28:28,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 08:28:28,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:28:28,510 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:28:28,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 08:28:28,510 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:28:28,511 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:28:28,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:28:28,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:28:28,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:28:28,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:28:28,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:28:28,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:28:28,512 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:28:28,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:28:28,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:28:28,513 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:28:28,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:28:28,513 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_b70a0178-67a9-4fa8-8fff-908acb484ce7/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_b70a0178-67a9-4fa8-8fff-908acb484ce7/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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2023-12-02 08:28:28,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:28:28,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:28:28,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:28:28,739 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:28:28,739 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:28:28,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2023-12-02 08:28:31,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:28:31,812 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:28:31,813 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2023-12-02 08:28:31,831 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data/aa4df5fdd/7121351428f3418fa5b57db0f8ff259c/FLAG6b8358efa [2023-12-02 08:28:31,843 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data/aa4df5fdd/7121351428f3418fa5b57db0f8ff259c [2023-12-02 08:28:31,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:28:31,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:28:31,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:28:31,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:28:31,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:28:31,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:31" (1/1) ... [2023-12-02 08:28:31,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1229a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:31, skipping insertion in model container [2023-12-02 08:28:31,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:31" (1/1) ... [2023-12-02 08:28:31,925 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:28:32,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:28:32,478 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 08:28:32,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3adcc9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:32, skipping insertion in model container [2023-12-02 08:28:32,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:28:32,479 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 08:28:32,481 INFO L158 Benchmark]: Toolchain (without parser) took 634.18ms. Allocated memory is still 146.8MB. Free memory was 99.7MB in the beginning and 77.8MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 08:28:32,482 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:28:32,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.94ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 77.8MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 08:28:32,484 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.17ms. Allocated memory is still 98.6MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.94ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 77.8MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/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_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/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_b70a0178-67a9-4fa8-8fff-908acb484ce7/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 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:28:34,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:28:34,304 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 08:28:34,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:28:34,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:28:34,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:28:34,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:28:34,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:28:34,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:28:34,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:28:34,341 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:28:34,342 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:28:34,342 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:28:34,343 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:28:34,343 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:28:34,344 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:28:34,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 08:28:34,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 08:28:34,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:28:34,346 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:28:34,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:28:34,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:28:34,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:28:34,350 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 08:28:34,350 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 08:28:34,351 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 08:28:34,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:28:34,352 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:28:34,352 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 08:28:34,352 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 08:28:34,353 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 08:28:34,353 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:28:34,353 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:28:34,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:28:34,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 08:28:34,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:28:34,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:28:34,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:28:34,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:28:34,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:28:34,355 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 08:28:34,356 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 08:28:34,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:28:34,356 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:28:34,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:28:34,356 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_b70a0178-67a9-4fa8-8fff-908acb484ce7/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_b70a0178-67a9-4fa8-8fff-908acb484ce7/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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2023-12-02 08:28:34,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:28:34,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:28:34,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:28:34,659 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:28:34,659 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:28:34,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2023-12-02 08:28:37,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:28:37,762 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:28:37,763 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2023-12-02 08:28:37,782 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data/e99b191e7/b2df4f2d5c444f2aa65531d517d2b6c5/FLAG4bc30f0e3 [2023-12-02 08:28:37,797 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/data/e99b191e7/b2df4f2d5c444f2aa65531d517d2b6c5 [2023-12-02 08:28:37,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:28:37,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:28:37,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:28:37,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:28:37,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:28:37,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:37" (1/1) ... [2023-12-02 08:28:37,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c4041c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:37, skipping insertion in model container [2023-12-02 08:28:37,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:37" (1/1) ... [2023-12-02 08:28:37,909 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:28:38,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:28:38,543 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 08:28:38,557 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:28:38,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:28:38,641 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:28:38,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:28:38,781 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 08:28:38,788 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:28:38,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38 WrapperNode [2023-12-02 08:28:38,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:28:38,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:28:38,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:28:38,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:28:38,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,890 INFO L138 Inliner]: procedures = 285, calls = 298, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1048 [2023-12-02 08:28:38,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:28:38,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:28:38,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:28:38,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:28:38,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:38,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:39,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:28:39,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:28:39,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:28:39,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:28:39,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (1/1) ... [2023-12-02 08:28:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:28:39,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:28:39,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:28:39,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:28:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 08:28:39,080 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 08:28:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 08:28:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 08:28:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:28:39,080 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 08:28:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 08:28:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:28:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 08:28:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 08:28:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2023-12-02 08:28:39,081 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2023-12-02 08:28:39,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 08:28:39,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 08:28:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 08:28:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:28:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2023-12-02 08:28:39,082 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2023-12-02 08:28:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 08:28:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2023-12-02 08:28:39,082 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2023-12-02 08:28:39,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:28:39,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:28:39,291 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:28:39,293 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:28:43,640 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:28:43,804 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:28:43,804 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 08:28:43,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:28:43 BoogieIcfgContainer [2023-12-02 08:28:43,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:28:43,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:28:43,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:28:43,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:28:43,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:28:37" (1/3) ... [2023-12-02 08:28:43,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fc4acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:28:43, skipping insertion in model container [2023-12-02 08:28:43,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:38" (2/3) ... [2023-12-02 08:28:43,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fc4acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:28:43, skipping insertion in model container [2023-12-02 08:28:43,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:28:43" (3/3) ... [2023-12-02 08:28:43,815 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2023-12-02 08:28:43,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:28:43,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 528 error locations. [2023-12-02 08:28:43,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:28:43,900 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;@6817db2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:28:43,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 528 error locations. [2023-12-02 08:28:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 08:28:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 08:28:43,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:43,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 08:28:43,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:28:43,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 55333, now seen corresponding path program 1 times [2023-12-02 08:28:43,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:28:43,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641362377] [2023-12-02 08:28:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:43,959 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 08:28:43,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:28:43,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:43,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:44,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:28:44,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:28:44,187 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 08:28:44,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 08:28:44,199 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:28:44,200 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:28:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641362377] [2023-12-02 08:28:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641362377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:44,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:44,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 08:28:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68918074] [2023-12-02 08:28:44,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:44,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:28:44,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:28:44,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:28:44,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:28:44,239 INFO L87 Difference]: Start difference. First operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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 08:28:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:46,179 INFO L93 Difference]: Finished difference Result 1054 states and 1123 transitions. [2023-12-02 08:28:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:28:46,182 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 08:28:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:46,202 INFO L225 Difference]: With dead ends: 1054 [2023-12-02 08:28:46,202 INFO L226 Difference]: Without dead ends: 1053 [2023-12-02 08:28:46,204 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 08:28:46,207 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 650 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:46,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 862 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 08:28:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-12-02 08:28:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2023-12-02 08:28:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 459 states have (on average 2.3398692810457518) internal successors, (1074), 977 states have internal predecessors, (1074), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:28:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1104 transitions. [2023-12-02 08:28:46,312 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1104 transitions. Word has length 2 [2023-12-02 08:28:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:46,312 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1104 transitions. [2023-12-02 08:28:46,312 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 08:28:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1104 transitions. [2023-12-02 08:28:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 08:28:46,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:46,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 08:28:46,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:46,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:46,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:28:46,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash 55334, now seen corresponding path program 1 times [2023-12-02 08:28:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:28:46,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664268731] [2023-12-02 08:28:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:46,517 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 08:28:46,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:28:46,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:46,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:46,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 08:28:46,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:28:46,620 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 08:28:46,632 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 08:28:46,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:28:46,632 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:28:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664268731] [2023-12-02 08:28:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664268731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:46,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 08:28:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197907101] [2023-12-02 08:28:46,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:46,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:28:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:28:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:28:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:28:46,636 INFO L87 Difference]: Start difference. First operand 995 states and 1104 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 08:28:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:49,716 INFO L93 Difference]: Finished difference Result 1353 states and 1498 transitions. [2023-12-02 08:28:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:28:49,717 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 08:28:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:49,724 INFO L225 Difference]: With dead ends: 1353 [2023-12-02 08:28:49,724 INFO L226 Difference]: Without dead ends: 1353 [2023-12-02 08:28:49,724 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 08:28:49,725 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 382 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:49,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1265 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 08:28:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-12-02 08:28:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1165. [2023-12-02 08:28:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 628 states have (on average 2.3121019108280256) internal successors, (1452), 1145 states have internal predecessors, (1452), 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 08:28:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1486 transitions. [2023-12-02 08:28:49,756 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1486 transitions. Word has length 2 [2023-12-02 08:28:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:49,756 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1486 transitions. [2023-12-02 08:28:49,756 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 08:28:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1486 transitions. [2023-12-02 08:28:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:28:49,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:49,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 08:28:49,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:49,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:28:49,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash -435639276, now seen corresponding path program 1 times [2023-12-02 08:28:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:28:49,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919771539] [2023-12-02 08:28:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:49,960 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 08:28:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:28:49,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:49,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:50,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 08:28:50,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:28:50,092 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 08:28:50,098 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 08:28:50,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:28:50,161 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 08:28:50,181 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:28:50,181 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 08:28:50,201 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 08:28:50,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:28:50,201 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:28:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919771539] [2023-12-02 08:28:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919771539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:28:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510538567] [2023-12-02 08:28:50,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:28:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:28:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:28:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:28:50,204 INFO L87 Difference]: Start difference. First operand 1165 states and 1486 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 08:28:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:54,219 INFO L93 Difference]: Finished difference Result 1792 states and 2170 transitions. [2023-12-02 08:28:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:28:54,221 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 08:28:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:54,231 INFO L225 Difference]: With dead ends: 1792 [2023-12-02 08:28:54,231 INFO L226 Difference]: Without dead ends: 1792 [2023-12-02 08:28:54,231 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 08:28:54,232 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 1292 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:54,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1013 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 08:28:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-12-02 08:28:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1281. [2023-12-02 08:28:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 744 states have (on average 2.293010752688172) internal successors, (1706), 1261 states have internal predecessors, (1706), 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 08:28:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1740 transitions. [2023-12-02 08:28:54,273 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1740 transitions. Word has length 6 [2023-12-02 08:28:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:54,274 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1740 transitions. [2023-12-02 08:28:54,274 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 08:28:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1740 transitions. [2023-12-02 08:28:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 08:28:54,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:54,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:54,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:54,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:54,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:28:54,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash -619915645, now seen corresponding path program 1 times [2023-12-02 08:28:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:28:54,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171761684] [2023-12-02 08:28:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:54,477 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 08:28:54,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:28:54,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:54,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:54,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 08:28:54,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:28:54,645 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 08:28:54,657 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 08:28:54,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:28:54,658 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:28:54,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171761684] [2023-12-02 08:28:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171761684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:28:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005975083] [2023-12-02 08:28:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:54,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:28:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:28:54,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:28:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:28:54,661 INFO L87 Difference]: Start difference. First operand 1281 states and 1740 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 08:28:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:56,695 INFO L93 Difference]: Finished difference Result 1760 states and 2444 transitions. [2023-12-02 08:28:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:28:56,697 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 08:28:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:56,705 INFO L225 Difference]: With dead ends: 1760 [2023-12-02 08:28:56,705 INFO L226 Difference]: Without dead ends: 1760 [2023-12-02 08:28:56,705 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 08:28:56,706 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 869 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:56,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1073 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-02 08:28:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2023-12-02 08:28:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1236. [2023-12-02 08:28:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 744 states have (on average 2.213709677419355) internal successors, (1647), 1216 states have internal predecessors, (1647), 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 08:28:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1681 transitions. [2023-12-02 08:28:56,736 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1681 transitions. Word has length 7 [2023-12-02 08:28:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:56,737 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1681 transitions. [2023-12-02 08:28:56,737 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 08:28:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1681 transitions. [2023-12-02 08:28:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 08:28:56,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:56,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:56,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:56,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:56,940 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:28:56,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash -619915644, now seen corresponding path program 1 times [2023-12-02 08:28:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:28:56,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114971344] [2023-12-02 08:28:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:56,942 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 08:28:56,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:28:56,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:56,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:28:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:57,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:28:57,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:28:57,055 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 08:28:57,081 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 08:28:57,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:28:57,081 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:28:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114971344] [2023-12-02 08:28:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114971344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:57,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:57,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:28:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773862708] [2023-12-02 08:28:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:57,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:28:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:28:57,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:28:57,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:28:57,084 INFO L87 Difference]: Start difference. First operand 1236 states and 1681 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 08:29:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:00,094 INFO L93 Difference]: Finished difference Result 1793 states and 2433 transitions. [2023-12-02 08:29:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:29:00,095 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 08:29:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:00,102 INFO L225 Difference]: With dead ends: 1793 [2023-12-02 08:29:00,102 INFO L226 Difference]: Without dead ends: 1793 [2023-12-02 08:29:00,103 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 08:29:00,103 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 620 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:00,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1340 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 08:29:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2023-12-02 08:29:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1226. [2023-12-02 08:29:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 744 states have (on average 2.181451612903226) internal successors, (1623), 1206 states have internal predecessors, (1623), 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 08:29:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1657 transitions. [2023-12-02 08:29:00,140 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1657 transitions. Word has length 7 [2023-12-02 08:29:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:00,141 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1657 transitions. [2023-12-02 08:29:00,141 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 08:29:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1657 transitions. [2023-12-02 08:29:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 08:29:00,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:00,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:29:00,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 08:29:00,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:00,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:00,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash -3807760, now seen corresponding path program 1 times [2023-12-02 08:29:00,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:00,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429722939] [2023-12-02 08:29:00,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:00,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 08:29:00,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:00,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:00,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:00,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:29:00,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:00,537 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 08:29:00,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:00,538 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429722939] [2023-12-02 08:29:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429722939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:00,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:00,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:29:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213451080] [2023-12-02 08:29:00,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:00,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:29:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:29:00,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:29:00,539 INFO L87 Difference]: Start difference. First operand 1226 states and 1657 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 08:29:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:02,263 INFO L93 Difference]: Finished difference Result 1658 states and 2181 transitions. [2023-12-02 08:29:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:29:02,264 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 08:29:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:02,271 INFO L225 Difference]: With dead ends: 1658 [2023-12-02 08:29:02,271 INFO L226 Difference]: Without dead ends: 1658 [2023-12-02 08:29:02,271 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 08:29:02,272 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 494 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:02,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2481 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 08:29:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2023-12-02 08:29:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1436. [2023-12-02 08:29:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 954 states have (on average 2.190775681341719) internal successors, (2090), 1416 states have internal predecessors, (2090), 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 08:29:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2124 transitions. [2023-12-02 08:29:02,313 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2124 transitions. Word has length 12 [2023-12-02 08:29:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:02,313 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 2124 transitions. [2023-12-02 08:29:02,314 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 08:29:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2124 transitions. [2023-12-02 08:29:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 08:29:02,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:02,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:29:02,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 08:29:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:02,515 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:02,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash -592731144, now seen corresponding path program 1 times [2023-12-02 08:29:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771436170] [2023-12-02 08:29:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:02,516 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 08:29:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:02,517 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:02,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:02,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 08:29:02,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:02,637 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 08:29:02,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:02,637 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771436170] [2023-12-02 08:29:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771436170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:02,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:29:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320405496] [2023-12-02 08:29:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:02,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:29:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:29:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:29:02,639 INFO L87 Difference]: Start difference. First operand 1436 states and 2124 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 08:29:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:03,381 INFO L93 Difference]: Finished difference Result 1352 states and 1964 transitions. [2023-12-02 08:29:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:29:03,383 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 08:29:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:03,389 INFO L225 Difference]: With dead ends: 1352 [2023-12-02 08:29:03,389 INFO L226 Difference]: Without dead ends: 1352 [2023-12-02 08:29:03,389 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 08:29:03,390 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 70 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:03,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1583 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 08:29:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-02 08:29:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2023-12-02 08:29:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 894 states have (on average 2.1588366890380315) internal successors, (1930), 1332 states have internal predecessors, (1930), 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 08:29:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1964 transitions. [2023-12-02 08:29:03,414 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1964 transitions. Word has length 12 [2023-12-02 08:29:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:03,414 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1964 transitions. [2023-12-02 08:29:03,415 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 08:29:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1964 transitions. [2023-12-02 08:29:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 08:29:03,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:03,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:29:03,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-02 08:29:03,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:03,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:03,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1869888457, now seen corresponding path program 1 times [2023-12-02 08:29:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688231625] [2023-12-02 08:29:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:03,622 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 08:29:03,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:03,623 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:03,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:03,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 08:29:03,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:03,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:29:03,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:29:03,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:29:03,777 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 08:29:03,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:29:03,838 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 08:29:03,853 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 08:29:03,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:03,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:03,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688231625] [2023-12-02 08:29:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688231625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:03,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:29:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339576880] [2023-12-02 08:29:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:03,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:29:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:03,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:29:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:29:03,855 INFO L87 Difference]: Start difference. First operand 1352 states and 1964 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 08:29:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:05,685 INFO L93 Difference]: Finished difference Result 1382 states and 1742 transitions. [2023-12-02 08:29:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:29:05,687 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 08:29:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:05,693 INFO L225 Difference]: With dead ends: 1382 [2023-12-02 08:29:05,693 INFO L226 Difference]: Without dead ends: 1382 [2023-12-02 08:29:05,693 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 08:29:05,693 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 290 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:05,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2405 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 08:29:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2023-12-02 08:29:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1085. [2023-12-02 08:29:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 629 states have (on average 2.1446740858505566) internal successors, (1349), 1067 states have internal predecessors, (1349), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:29:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1379 transitions. [2023-12-02 08:29:05,711 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1379 transitions. Word has length 15 [2023-12-02 08:29:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:05,711 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1379 transitions. [2023-12-02 08:29:05,712 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 08:29:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1379 transitions. [2023-12-02 08:29:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 08:29:05,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:05,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:29:05,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:05,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:05,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:05,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1792162074, now seen corresponding path program 1 times [2023-12-02 08:29:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489655109] [2023-12-02 08:29:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:05,914 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 08:29:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:05,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:05,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:06,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 08:29:06,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:06,068 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 08:29:06,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:06,069 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:06,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489655109] [2023-12-02 08:29:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489655109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:06,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:29:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547082091] [2023-12-02 08:29:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:06,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:29:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:29:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:29:06,070 INFO L87 Difference]: Start difference. First operand 1085 states and 1379 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 08:29:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:06,894 INFO L93 Difference]: Finished difference Result 1031 states and 1299 transitions. [2023-12-02 08:29:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:29:06,896 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 08:29:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:06,900 INFO L225 Difference]: With dead ends: 1031 [2023-12-02 08:29:06,900 INFO L226 Difference]: Without dead ends: 1031 [2023-12-02 08:29:06,900 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 08:29:06,900 INFO L413 NwaCegarLoop]: 779 mSDtfsCounter, 70 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:06,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1509 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 08:29:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-12-02 08:29:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2023-12-02 08:29:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 599 states have (on average 2.1185308848080133) internal successors, (1269), 1013 states have internal predecessors, (1269), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:29:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1299 transitions. [2023-12-02 08:29:06,915 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1299 transitions. Word has length 15 [2023-12-02 08:29:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:06,915 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1299 transitions. [2023-12-02 08:29:06,915 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 08:29:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1299 transitions. [2023-12-02 08:29:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 08:29:06,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:06,916 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 08:29:06,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:07,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:07,117 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:07,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash -14134636, now seen corresponding path program 1 times [2023-12-02 08:29:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:07,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183525343] [2023-12-02 08:29:07,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:07,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:29:07,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:07,119 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:07,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:07,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:29:07,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:07,310 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 08:29:07,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:07,311 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183525343] [2023-12-02 08:29:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183525343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:29:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24549523] [2023-12-02 08:29:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:07,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:29:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:07,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:29:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:29:07,312 INFO L87 Difference]: Start difference. First operand 1031 states and 1299 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 08:29:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:08,214 INFO L93 Difference]: Finished difference Result 1017 states and 1257 transitions. [2023-12-02 08:29:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:29:08,216 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 08:29:08,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:08,221 INFO L225 Difference]: With dead ends: 1017 [2023-12-02 08:29:08,221 INFO L226 Difference]: Without dead ends: 1017 [2023-12-02 08:29:08,221 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 08:29:08,222 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 58 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:08,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2220 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 08:29:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2023-12-02 08:29:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2023-12-02 08:29:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 597 states have (on average 2.0519262981574538) internal successors, (1225), 997 states have internal predecessors, (1225), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:29:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1255 transitions. [2023-12-02 08:29:08,242 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1255 transitions. Word has length 17 [2023-12-02 08:29:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:08,242 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1255 transitions. [2023-12-02 08:29:08,242 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 08:29:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1255 transitions. [2023-12-02 08:29:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:29:08,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:08,243 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 08:29:08,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:08,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:08,444 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:08,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash 734266083, now seen corresponding path program 1 times [2023-12-02 08:29:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:08,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430999221] [2023-12-02 08:29:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:08,445 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 08:29:08,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:08,446 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:08,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:08,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 08:29:08,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:08,646 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 08:29:08,827 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 08:29:08,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:08,827 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430999221] [2023-12-02 08:29:08,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430999221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:08,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:08,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:29:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43368725] [2023-12-02 08:29:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:08,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:29:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:08,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:29:08,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:29:08,829 INFO L87 Difference]: Start difference. First operand 1015 states and 1255 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 08:29:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:12,449 INFO L93 Difference]: Finished difference Result 1482 states and 1848 transitions. [2023-12-02 08:29:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:29:12,451 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 08:29:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:12,456 INFO L225 Difference]: With dead ends: 1482 [2023-12-02 08:29:12,456 INFO L226 Difference]: Without dead ends: 1482 [2023-12-02 08:29:12,457 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 08:29:12,457 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 523 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:12,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1885 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-02 08:29:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2023-12-02 08:29:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1011. [2023-12-02 08:29:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 597 states have (on average 2.0385259631490786) internal successors, (1217), 993 states have internal predecessors, (1217), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:29:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1247 transitions. [2023-12-02 08:29:12,480 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1247 transitions. Word has length 31 [2023-12-02 08:29:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:12,481 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1247 transitions. [2023-12-02 08:29:12,481 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 08:29:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1247 transitions. [2023-12-02 08:29:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:29:12,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:12,482 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 08:29:12,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:12,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:12,683 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:12,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash 734266082, now seen corresponding path program 1 times [2023-12-02 08:29:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:12,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394065934] [2023-12-02 08:29:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:12,684 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 08:29:12,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:12,684 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:12,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:12,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:29:12,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:12,881 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 08:29:12,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 08:29:12,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:12,962 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394065934] [2023-12-02 08:29:12,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394065934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:12,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:12,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:29:12,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58899687] [2023-12-02 08:29:12,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:12,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:29:12,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:12,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:29:12,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:29:12,964 INFO L87 Difference]: Start difference. First operand 1011 states and 1247 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 08:29:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:15,426 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2023-12-02 08:29:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:29:15,428 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 08:29:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:15,435 INFO L225 Difference]: With dead ends: 1391 [2023-12-02 08:29:15,435 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 08:29:15,435 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 08:29:15,436 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 754 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:15,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1032 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 08:29:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 08:29:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1007. [2023-12-02 08:29:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 597 states have (on average 2.0251256281407035) internal successors, (1209), 989 states have internal predecessors, (1209), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:29:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1239 transitions. [2023-12-02 08:29:15,456 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1239 transitions. Word has length 31 [2023-12-02 08:29:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:15,457 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1239 transitions. [2023-12-02 08:29:15,457 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 08:29:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1239 transitions. [2023-12-02 08:29:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 08:29:15,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:15,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:29:15,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:15,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:15,659 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:15,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2030840777, now seen corresponding path program 1 times [2023-12-02 08:29:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376219626] [2023-12-02 08:29:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:15,661 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 08:29:15,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:15,662 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:15,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:15,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:29:15,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:15,920 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 08:29:15,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:15,920 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376219626] [2023-12-02 08:29:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376219626] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:29:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772617631] [2023-12-02 08:29:15,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:15,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:29:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:29:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:29:15,922 INFO L87 Difference]: Start difference. First operand 1007 states and 1239 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 08:29:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:16,819 INFO L93 Difference]: Finished difference Result 995 states and 1219 transitions. [2023-12-02 08:29:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:29:16,821 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 08:29:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:16,825 INFO L225 Difference]: With dead ends: 995 [2023-12-02 08:29:16,825 INFO L226 Difference]: Without dead ends: 995 [2023-12-02 08:29:16,825 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 08:29:16,825 INFO L413 NwaCegarLoop]: 742 mSDtfsCounter, 23 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:16,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2206 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 08:29:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2023-12-02 08:29:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2023-12-02 08:29:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 585 states have (on average 2.0324786324786324) internal successors, (1189), 977 states have internal predecessors, (1189), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 08:29:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1219 transitions. [2023-12-02 08:29:16,837 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1219 transitions. Word has length 51 [2023-12-02 08:29:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:16,837 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1219 transitions. [2023-12-02 08:29:16,837 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 08:29:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1219 transitions. [2023-12-02 08:29:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 08:29:16,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:16,838 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 08:29:16,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:17,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:17,039 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:17,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890552, now seen corresponding path program 1 times [2023-12-02 08:29:17,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:17,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599609954] [2023-12-02 08:29:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:17,040 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 08:29:17,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:17,041 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:17,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:17,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 08:29:17,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:17,396 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 08:29:17,397 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 21 treesize of output 20 [2023-12-02 08:29:17,433 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 08:29:17,434 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 08:29:17,674 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 08:29:17,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:17,674 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:17,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599609954] [2023-12-02 08:29:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599609954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:17,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 08:29:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927102079] [2023-12-02 08:29:17,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:17,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:29:17,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:29:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:29:17,676 INFO L87 Difference]: Start difference. First operand 995 states and 1219 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 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 08:29:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:20,051 INFO L93 Difference]: Finished difference Result 1813 states and 2222 transitions. [2023-12-02 08:29:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:29:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 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 08:29:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:20,061 INFO L225 Difference]: With dead ends: 1813 [2023-12-02 08:29:20,061 INFO L226 Difference]: Without dead ends: 1813 [2023-12-02 08:29:20,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 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 08:29:20,061 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 713 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:20,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 918 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 08:29:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-12-02 08:29:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1343. [2023-12-02 08:29:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 918 states have (on average 2.02723311546841) internal successors, (1861), 1313 states have internal predecessors, (1861), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 08:29:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1915 transitions. [2023-12-02 08:29:20,082 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1915 transitions. Word has length 55 [2023-12-02 08:29:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:20,082 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1915 transitions. [2023-12-02 08:29:20,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 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 08:29:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1915 transitions. [2023-12-02 08:29:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 08:29:20,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:20,083 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 08:29:20,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:20,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:20,284 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:20,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:20,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890553, now seen corresponding path program 1 times [2023-12-02 08:29:20,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:20,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052165208] [2023-12-02 08:29:20,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:20,285 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 08:29:20,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:20,286 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:20,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:20,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 08:29:20,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:20,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:29:20,632 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 08:29:20,698 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 08:29:20,699 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 08:29:21,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 08:29:21,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:21,273 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052165208] [2023-12-02 08:29:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052165208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:29:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30805798] [2023-12-02 08:29:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:21,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:29:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:21,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:29:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:29:21,275 INFO L87 Difference]: Start difference. First operand 1343 states and 1915 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 08:29:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:24,087 INFO L93 Difference]: Finished difference Result 1348 states and 1921 transitions. [2023-12-02 08:29:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:29:24,088 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 08:29:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:24,094 INFO L225 Difference]: With dead ends: 1348 [2023-12-02 08:29:24,094 INFO L226 Difference]: Without dead ends: 1348 [2023-12-02 08:29:24,095 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 08:29:24,095 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:24,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 08:29:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2023-12-02 08:29:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1348. [2023-12-02 08:29:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 922 states have (on average 2.022776572668113) internal successors, (1865), 1317 states have internal predecessors, (1865), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-02 08:29:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1921 transitions. [2023-12-02 08:29:24,115 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1921 transitions. Word has length 55 [2023-12-02 08:29:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:24,116 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1921 transitions. [2023-12-02 08:29:24,116 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 08:29:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1921 transitions. [2023-12-02 08:29:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 08:29:24,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:24,117 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 08:29:24,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:24,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:24,317 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:24,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 298511460, now seen corresponding path program 1 times [2023-12-02 08:29:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:24,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846357848] [2023-12-02 08:29:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 08:29:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:24,319 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:24,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:24,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:29:24,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:24,698 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 08:29:24,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:24,699 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846357848] [2023-12-02 08:29:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846357848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:29:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047391726] [2023-12-02 08:29:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:24,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:29:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:29:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:29:24,700 INFO L87 Difference]: Start difference. First operand 1348 states and 1921 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 08:29:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:26,192 INFO L93 Difference]: Finished difference Result 1352 states and 1929 transitions. [2023-12-02 08:29:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:29:26,194 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 08:29:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:26,201 INFO L225 Difference]: With dead ends: 1352 [2023-12-02 08:29:26,201 INFO L226 Difference]: Without dead ends: 1352 [2023-12-02 08:29:26,201 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 08:29:26,201 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 19 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:26,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2897 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 08:29:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-02 08:29:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2023-12-02 08:29:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 923 states have (on average 2.021668472372698) internal successors, (1866), 1318 states have internal predecessors, (1866), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (29), 22 states have call predecessors, (29), 26 states have call successors, (29) [2023-12-02 08:29:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1925 transitions. [2023-12-02 08:29:26,228 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1925 transitions. Word has length 59 [2023-12-02 08:29:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:26,229 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1925 transitions. [2023-12-02 08:29:26,229 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 08:29:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1925 transitions. [2023-12-02 08:29:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 08:29:26,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:26,230 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 08:29:26,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:26,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:26,430 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:26,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1320167083, now seen corresponding path program 1 times [2023-12-02 08:29:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:26,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710815200] [2023-12-02 08:29:26,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:26,431 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 08:29:26,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:26,432 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:26,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:26,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:29:26,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:26,763 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 08:29:26,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:26,764 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710815200] [2023-12-02 08:29:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710815200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:26,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:26,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:29:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368095999] [2023-12-02 08:29:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:26,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:29:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:26,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:29:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:29:26,765 INFO L87 Difference]: Start difference. First operand 1350 states and 1925 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 08:29:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:28,200 INFO L93 Difference]: Finished difference Result 1374 states and 1949 transitions. [2023-12-02 08:29:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:29:28,201 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 08:29:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:28,208 INFO L225 Difference]: With dead ends: 1374 [2023-12-02 08:29:28,208 INFO L226 Difference]: Without dead ends: 1374 [2023-12-02 08:29:28,209 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 08:29:28,209 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 16 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3763 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:28,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3763 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 08:29:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-12-02 08:29:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1370. [2023-12-02 08:29:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 937 states have (on average 2.0117395944503733) internal successors, (1885), 1334 states have internal predecessors, (1885), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 08:29:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1946 transitions. [2023-12-02 08:29:28,235 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1946 transitions. Word has length 62 [2023-12-02 08:29:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:28,236 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1946 transitions. [2023-12-02 08:29:28,236 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 08:29:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1946 transitions. [2023-12-02 08:29:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 08:29:28,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:28,237 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 08:29:28,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:28,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:28,437 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:28,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192545, now seen corresponding path program 1 times [2023-12-02 08:29:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406010375] [2023-12-02 08:29:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:28,438 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 08:29:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:28,439 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:28,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:28,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 08:29:28,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:28,841 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 08:29:28,943 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 08:29:28,958 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 08:29:28,958 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 08:29:28,967 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 08:29:28,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:28,968 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406010375] [2023-12-02 08:29:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406010375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:28,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:29:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578338041] [2023-12-02 08:29:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:28,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:29:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:28,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:29:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 08:29:28,970 INFO L87 Difference]: Start difference. First operand 1370 states and 1946 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 08:29:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:31,308 INFO L93 Difference]: Finished difference Result 1753 states and 2454 transitions. [2023-12-02 08:29:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:29:31,308 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 08:29:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:31,315 INFO L225 Difference]: With dead ends: 1753 [2023-12-02 08:29:31,315 INFO L226 Difference]: Without dead ends: 1753 [2023-12-02 08:29:31,315 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 08:29:31,315 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 723 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:31,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 977 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1113 Invalid, 0 Unknown, 1207 Unchecked, 2.3s Time] [2023-12-02 08:29:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2023-12-02 08:29:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1369. [2023-12-02 08:29:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 937 states have (on average 2.0096051227321237) internal successors, (1883), 1333 states have internal predecessors, (1883), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 08:29:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1944 transitions. [2023-12-02 08:29:31,335 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1944 transitions. Word has length 64 [2023-12-02 08:29:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:31,335 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 1944 transitions. [2023-12-02 08:29:31,335 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 08:29:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1944 transitions. [2023-12-02 08:29:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 08:29:31,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:31,336 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 08:29:31,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:31,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:31,537 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:31,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192544, now seen corresponding path program 1 times [2023-12-02 08:29:31,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:31,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045514479] [2023-12-02 08:29:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:31,537 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 08:29:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:31,538 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:31,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:31,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 08:29:31,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:31,920 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 08:29:31,924 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 08:29:32,330 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 08:29:32,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:29:32,343 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 08:29:32,354 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:29:32,354 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 08:29:32,363 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 08:29:32,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:32,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:32,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045514479] [2023-12-02 08:29:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045514479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:32,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:32,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:29:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401574502] [2023-12-02 08:29:32,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:32,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:29:32,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:32,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:29:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-12-02 08:29:32,365 INFO L87 Difference]: Start difference. First operand 1369 states and 1944 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 08:29:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:37,787 INFO L93 Difference]: Finished difference Result 2312 states and 3241 transitions. [2023-12-02 08:29:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:29:37,788 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 08:29:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:37,794 INFO L225 Difference]: With dead ends: 2312 [2023-12-02 08:29:37,794 INFO L226 Difference]: Without dead ends: 2312 [2023-12-02 08:29:37,794 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 08:29:37,794 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 835 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1617 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:37,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1657 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2639 Invalid, 0 Unknown, 1617 Unchecked, 5.4s Time] [2023-12-02 08:29:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2023-12-02 08:29:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1365. [2023-12-02 08:29:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 941 states have (on average 1.9883103081827842) internal successors, (1871), 1329 states have internal predecessors, (1871), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 08:29:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1932 transitions. [2023-12-02 08:29:37,815 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1932 transitions. Word has length 64 [2023-12-02 08:29:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:37,816 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1932 transitions. [2023-12-02 08:29:37,816 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 08:29:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1932 transitions. [2023-12-02 08:29:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 08:29:37,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:37,817 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 08:29:37,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Ended with exit code 0 [2023-12-02 08:29:38,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:38,017 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:38,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1110857919, now seen corresponding path program 1 times [2023-12-02 08:29:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135086530] [2023-12-02 08:29:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:38,018 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 08:29:38,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:38,019 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:38,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:38,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 08:29:38,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:38,291 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 08:29:38,311 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 08:29:38,333 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 08:29:38,372 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 08:29:38,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:38,372 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135086530] [2023-12-02 08:29:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135086530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:29:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240240298] [2023-12-02 08:29:38,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:38,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 08:29:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 08:29:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:29:38,374 INFO L87 Difference]: Start difference. First operand 1365 states and 1932 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 08:29:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:42,371 INFO L93 Difference]: Finished difference Result 1376 states and 1944 transitions. [2023-12-02 08:29:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:29:42,371 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 08:29:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:42,375 INFO L225 Difference]: With dead ends: 1376 [2023-12-02 08:29:42,375 INFO L226 Difference]: Without dead ends: 1376 [2023-12-02 08:29:42,375 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 08:29:42,376 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 14 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3256 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:42,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3256 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 08:29:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2023-12-02 08:29:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1375. [2023-12-02 08:29:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.9841938883034773) internal successors, (1883), 1337 states have internal predecessors, (1883), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 08:29:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1944 transitions. [2023-12-02 08:29:42,394 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1944 transitions. Word has length 70 [2023-12-02 08:29:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:42,394 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1944 transitions. [2023-12-02 08:29:42,394 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 08:29:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1944 transitions. [2023-12-02 08:29:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 08:29:42,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:42,395 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 08:29:42,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:42,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:42,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:42,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash 76857197, now seen corresponding path program 1 times [2023-12-02 08:29:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:42,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651591765] [2023-12-02 08:29:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:42,596 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 08:29:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:42,597 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:42,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:42,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 08:29:42,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:42,916 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 08:29:42,945 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 08:29:42,954 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 08:29:42,990 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 08:29:43,068 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 08:29:43,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:43,068 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:43,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651591765] [2023-12-02 08:29:43,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651591765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:43,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:29:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679286368] [2023-12-02 08:29:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:43,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:29:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:29:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:29:43,070 INFO L87 Difference]: Start difference. First operand 1375 states and 1944 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 08:29:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:48,652 INFO L93 Difference]: Finished difference Result 1375 states and 1942 transitions. [2023-12-02 08:29:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:29:48,654 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 08:29:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:48,656 INFO L225 Difference]: With dead ends: 1375 [2023-12-02 08:29:48,656 INFO L226 Difference]: Without dead ends: 1375 [2023-12-02 08:29:48,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 08:29:48,657 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 12 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:48,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3828 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-02 08:29:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2023-12-02 08:29:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2023-12-02 08:29:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.982086406743941) internal successors, (1881), 1337 states have internal predecessors, (1881), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 08:29:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1942 transitions. [2023-12-02 08:29:48,676 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1942 transitions. Word has length 71 [2023-12-02 08:29:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:48,677 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1942 transitions. [2023-12-02 08:29:48,677 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 08:29:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1942 transitions. [2023-12-02 08:29:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 08:29:48,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:48,678 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 08:29:48,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:48,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:48,878 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:48,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -998618493, now seen corresponding path program 1 times [2023-12-02 08:29:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537351990] [2023-12-02 08:29:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:48,879 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 08:29:48,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:48,880 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:48,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:49,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:29:49,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:49,218 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 08:29:49,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:49,218 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537351990] [2023-12-02 08:29:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537351990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:49,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:29:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059631726] [2023-12-02 08:29:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:49,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:29:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:29:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:29:49,220 INFO L87 Difference]: Start difference. First operand 1375 states and 1942 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 08:29:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:50,403 INFO L93 Difference]: Finished difference Result 1383 states and 1952 transitions. [2023-12-02 08:29:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:29:50,405 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 08:29:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:50,407 INFO L225 Difference]: With dead ends: 1383 [2023-12-02 08:29:50,407 INFO L226 Difference]: Without dead ends: 1381 [2023-12-02 08:29:50,407 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 08:29:50,408 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 4 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:50,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2966 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 08:29:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2023-12-02 08:29:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2023-12-02 08:29:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 953 states have (on average 1.9800629590766001) internal successors, (1887), 1343 states have internal predecessors, (1887), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 08:29:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1950 transitions. [2023-12-02 08:29:50,429 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1950 transitions. Word has length 76 [2023-12-02 08:29:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:50,436 INFO L495 AbstractCegarLoop]: Abstraction has 1381 states and 1950 transitions. [2023-12-02 08:29:50,436 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 08:29:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1950 transitions. [2023-12-02 08:29:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 08:29:50,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:50,437 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 08:29:50,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-02 08:29:50,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:50,637 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:50,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2135152941, now seen corresponding path program 1 times [2023-12-02 08:29:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:50,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756856363] [2023-12-02 08:29:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:50,639 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 08:29:50,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:50,640 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:50,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:50,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:29:50,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:50,965 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 08:29:50,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:29:51,066 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 08:29:51,066 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756856363] [2023-12-02 08:29:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756856363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:29:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1404841687] [2023-12-02 08:29:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:51,066 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:29:51,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:29:51,067 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:29:51,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 08:29:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:51,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:29:51,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:29:51,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:29:51,650 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 08:29:51,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1404841687] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:29:51,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714712692] [2023-12-02 08:29:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:29:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:29:51,652 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:29:51,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 08:29:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:51,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 08:29:51,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:51,989 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 08:29:51,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:29:52,039 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 08:29:52,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714712692] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:29:52,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 08:29:52,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2023-12-02 08:29:52,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631985054] [2023-12-02 08:29:52,040 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 08:29:52,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:29:52,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:29:52,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:29:52,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:29:52,042 INFO L87 Difference]: Start difference. First operand 1381 states and 1950 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 08:29:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:54,008 INFO L93 Difference]: Finished difference Result 1395 states and 1968 transitions. [2023-12-02 08:29:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 08:29:54,010 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 08:29:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:54,012 INFO L225 Difference]: With dead ends: 1395 [2023-12-02 08:29:54,012 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 08:29:54,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-12-02 08:29:54,013 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 14 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5185 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:54,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5185 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 08:29:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 08:29:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2023-12-02 08:29:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 961 states have (on average 1.9739854318418315) internal successors, (1897), 1351 states have internal predecessors, (1897), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 08:29:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1960 transitions. [2023-12-02 08:29:54,027 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1960 transitions. Word has length 77 [2023-12-02 08:29:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:54,027 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1960 transitions. [2023-12-02 08:29:54,027 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 08:29:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1960 transitions. [2023-12-02 08:29:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 08:29:54,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:54,028 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 08:29:54,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:54,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-02 08:29:54,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-02 08:29:54,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:29:54,629 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:29:54,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -239229693, now seen corresponding path program 2 times [2023-12-02 08:29:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:29:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103785784] [2023-12-02 08:29:54,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 08:29:54,630 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 08:29:54,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:29:54,631 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:54,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:29:55,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 08:29:55,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:29:55,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 08:29:55,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:55,253 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 08:29:55,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:29:55,550 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 08:29:55,550 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:29:55,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103785784] [2023-12-02 08:29:55,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103785784] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:29:55,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1635112346] [2023-12-02 08:29:55,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 08:29:55,550 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:29:55,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:29:55,551 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:29:55,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 08:29:57,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 08:29:57,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:29:57,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 08:29:57,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:57,479 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 08:29:57,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:29:57,559 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 08:29:57,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1635112346] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:29:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146289712] [2023-12-02 08:29:57,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 08:29:57,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:29:57,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:29:57,560 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:29:57,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 08:30:36,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 08:30:36,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:30:36,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:30:36,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:36,222 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:30:36,222 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 08:30:36,258 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 08:30:36,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:30:36,596 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 08:30:36,664 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 08:30:36,697 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 08:30:36,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:36,820 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 08:30:36,820 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 08:30:36,827 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2335) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2023-12-02 08:30:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146289712] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:36,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 08:30:36,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2023-12-02 08:30:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696306522] [2023-12-02 08:30:36,829 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 08:30:36,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 08:30:36,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 08:30:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2023-12-02 08:30:36,831 INFO L87 Difference]: Start difference. First operand 1389 states and 1960 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 08:30:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:51,798 INFO L93 Difference]: Finished difference Result 1798 states and 2508 transitions. [2023-12-02 08:30:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 08:30:51,799 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 08:30:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:51,802 INFO L225 Difference]: With dead ends: 1798 [2023-12-02 08:30:51,802 INFO L226 Difference]: Without dead ends: 1794 [2023-12-02 08:30:51,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=619, Invalid=3166, Unknown=1, NotChecked=120, Total=3906 [2023-12-02 08:30:51,805 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 795 mSDsluCounter, 6538 mSDsCounter, 0 mSdLazyCounter, 8778 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 6933 SdHoareTripleChecker+Invalid, 8839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 8778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:51,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 6933 Invalid, 8839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 8778 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2023-12-02 08:30:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2023-12-02 08:30:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1406. [2023-12-02 08:30:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 979 states have (on average 1.9601634320735444) internal successors, (1919), 1368 states have internal predecessors, (1919), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 08:30:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1982 transitions. [2023-12-02 08:30:51,824 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1982 transitions. Word has length 80 [2023-12-02 08:30:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:51,825 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1982 transitions. [2023-12-02 08:30:51,825 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 08:30:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1982 transitions. [2023-12-02 08:30:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 08:30:51,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:51,826 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 08:30:51,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 08:30:52,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 08:30:52,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 08:30:52,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:52,427 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:30:52,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1517835460, now seen corresponding path program 1 times [2023-12-02 08:30:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:30:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993649609] [2023-12-02 08:30:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:52,428 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 08:30:52,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:30:52,429 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:30:52,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:30:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:52,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 08:30:52,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:53,005 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 08:30:53,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:53,790 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 08:30:53,790 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:30:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993649609] [2023-12-02 08:30:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993649609] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:30:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [197024969] [2023-12-02 08:30:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:53,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:30:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:30:53,791 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:30:53,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 08:30:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:54,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 08:30:54,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:54,473 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 08:30:54,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:54,613 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 08:30:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [197024969] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:30:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647527075] [2023-12-02 08:30:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:54,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:54,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:54,615 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:54,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 08:30:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:54,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 08:30:54,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:55,116 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 08:30:55,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:56,771 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 08:30:56,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647527075] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:30:56,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 08:30:56,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2023-12-02 08:30:56,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160957440] [2023-12-02 08:30:56,772 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 08:30:56,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 08:30:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:30:56,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 08:30:56,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 08:30:56,774 INFO L87 Difference]: Start difference. First operand 1406 states and 1982 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 08:31:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:05,349 INFO L93 Difference]: Finished difference Result 1450 states and 2056 transitions. [2023-12-02 08:31:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 08:31:05,350 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 08:31:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:05,352 INFO L225 Difference]: With dead ends: 1450 [2023-12-02 08:31:05,352 INFO L226 Difference]: Without dead ends: 1444 [2023-12-02 08:31:05,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1295, Invalid=2737, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 08:31:05,353 INFO L413 NwaCegarLoop]: 744 mSDtfsCounter, 75 mSDsluCounter, 11097 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 11841 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:05,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 11841 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-02 08:31:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-12-02 08:31:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1442. [2023-12-02 08:31:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1015 states have (on average 1.935960591133005) internal successors, (1965), 1404 states have internal predecessors, (1965), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 08:31:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2028 transitions. [2023-12-02 08:31:05,367 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2028 transitions. Word has length 86 [2023-12-02 08:31:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:05,368 INFO L495 AbstractCegarLoop]: Abstraction has 1442 states and 2028 transitions. [2023-12-02 08:31:05,368 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 08:31:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2028 transitions. [2023-12-02 08:31:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 08:31:05,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:05,369 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 08:31:05,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-12-02 08:31:05,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:31:05,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 08:31:05,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:31:05,970 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:31:05,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1951482948, now seen corresponding path program 2 times [2023-12-02 08:31:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:31:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271405822] [2023-12-02 08:31:05,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 08:31:05,971 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 08:31:05,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:31:05,971 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:31:05,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:31:06,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 08:31:06,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:31:06,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 08:31:06,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:07,319 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 08:31:07,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:09,517 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 08:31:09,517 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:31:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271405822] [2023-12-02 08:31:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271405822] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:31:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [733929360] [2023-12-02 08:31:09,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 08:31:09,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:31:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:31:09,518 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:31:09,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 08:31:11,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 08:31:11,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:31:11,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 08:31:11,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:11,926 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 08:31:11,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:31:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [733929360] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:31:12,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93746375] [2023-12-02 08:31:12,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 08:31:12,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:31:12,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:31:12,274 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:31:12,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 08:32:06,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 08:32:06,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:32:06,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 08:32:06,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:06,798 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 08:32:06,898 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:32:06,898 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 08:32:07,005 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 08:32:07,014 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 08:32:07,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 08:32:07,311 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 08:32:08,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:32:08,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 08:32:08,324 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 08:32:08,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 08:32:08,511 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 08:32:08,608 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 08:32:08,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:09,510 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 08:32:09,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93746375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:09,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 08:32:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2023-12-02 08:32:09,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995244355] [2023-12-02 08:32:09,516 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 08:32:09,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-02 08:32:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:32:09,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-02 08:32:09,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3528, Unknown=1, NotChecked=128, Total=4422 [2023-12-02 08:32:09,519 INFO L87 Difference]: Start difference. First operand 1442 states and 2028 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 08:32:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:59,925 INFO L93 Difference]: Finished difference Result 1899 states and 2674 transitions. [2023-12-02 08:32:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-02 08:32:59,926 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 08:32:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:59,929 INFO L225 Difference]: With dead ends: 1899 [2023-12-02 08:32:59,930 INFO L226 Difference]: Without dead ends: 1895 [2023-12-02 08:32:59,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4790 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=3579, Invalid=17304, Unknown=1, NotChecked=286, Total=21170 [2023-12-02 08:32:59,937 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 922 mSDsluCounter, 11912 mSDsCounter, 0 mSdLazyCounter, 18946 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 12316 SdHoareTripleChecker+Invalid, 19001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 18946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:59,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 12316 Invalid, 19001 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 18946 Invalid, 0 Unknown, 0 Unchecked, 37.0s Time] [2023-12-02 08:32:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2023-12-02 08:32:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1509. [2023-12-02 08:32:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1083 states have (on average 1.8975069252077563) internal successors, (2055), 1471 states have internal predecessors, (2055), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 08:32:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2118 transitions. [2023-12-02 08:32:59,958 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2118 transitions. Word has length 98 [2023-12-02 08:32:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:59,958 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2118 transitions. [2023-12-02 08:32:59,959 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 08:32:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2118 transitions. [2023-12-02 08:32:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 08:32:59,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:59,959 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 08:32:59,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 08:33:00,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 08:33:00,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 08:33:00,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:33:00,560 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:33:00,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:00,561 INFO L85 PathProgramCache]: Analyzing trace with hash -769932828, now seen corresponding path program 1 times [2023-12-02 08:33:00,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:33:00,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630050595] [2023-12-02 08:33:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:00,561 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 08:33:00,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:33:00,562 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:33:00,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:33:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:01,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 08:33:01,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:01,403 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 08:33:01,535 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 08:33:01,535 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 08:33:01,568 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 08:33:01,659 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 08:33:02,778 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:33:02,778 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 08:33:02,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:33:02,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 08:33:02,924 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 08:33:02,975 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 08:33:02,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:05,113 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4172 (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_4172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 08:33:05,542 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4218))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4172)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 08:33:05,545 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:33:05,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630050595] [2023-12-02 08:33:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630050595] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:05,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1928604828] [2023-12-02 08:33:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:05,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:33:05,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:33:05,546 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:33:05,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 08:33:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:09,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 08:33:09,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:09,340 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 08:33:09,687 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:33:09,687 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 08:33:09,736 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 08:33:10,397 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:33:10,397 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 25 treesize of output 26 [2023-12-02 08:33:10,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:33:10,496 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 08:33:10,565 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 08:33:10,569 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 08:33:10,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:10,593 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 08:33:10,593 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 08:33:10,601 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem74#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4656) |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 08:33:10,611 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (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_4656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 08:33:11,073 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4702)) (.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_4656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 08:33:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1928604828] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305917238] [2023-12-02 08:33:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:11,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:33:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:33:11,076 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:33:11,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 08:33:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:11,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 08:33:11,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:11,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 08:33:11,853 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:33:11,854 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 08:33:11,908 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 08:33:12,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:33:12,851 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 08:33:13,057 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:33:13,057 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 08:33:13,068 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 08:33:13,073 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 08:33:13,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:13,089 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 (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_5140) |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 08:33:13,686 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 08:33:13,687 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 08:33:13,697 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5186 (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_5186))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5140)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2023-12-02 08:33:13,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305917238] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:13,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:33:13,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 33 [2023-12-02 08:33:13,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180289683] [2023-12-02 08:33:13,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:33:13,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 08:33:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:33:13,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 08:33:13,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1183, Unknown=16, NotChecked=532, Total=1892 [2023-12-02 08:33:13,702 INFO L87 Difference]: Start difference. First operand 1509 states and 2118 transitions. Second operand has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 08:33:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:33:23,683 INFO L93 Difference]: Finished difference Result 1892 states and 2624 transitions. [2023-12-02 08:33:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 08:33:23,691 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 122 [2023-12-02 08:33:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:33:23,695 INFO L225 Difference]: With dead ends: 1892 [2023-12-02 08:33:23,695 INFO L226 Difference]: Without dead ends: 1892 [2023-12-02 08:33:23,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=327, Invalid=2337, Unknown=16, NotChecked=742, Total=3422 [2023-12-02 08:33:23,697 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 1433 mSDsluCounter, 3802 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 4184 SdHoareTripleChecker+Invalid, 5678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 5603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:33:23,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 4184 Invalid, 5678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-12-02 08:33:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2023-12-02 08:33:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1506. [2023-12-02 08:33:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1083 states have (on average 1.89196675900277) internal successors, (2049), 1468 states have internal predecessors, (2049), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 08:33:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2112 transitions. [2023-12-02 08:33:23,720 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2112 transitions. Word has length 122 [2023-12-02 08:33:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:33:23,721 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 2112 transitions. [2023-12-02 08:33:23,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 08:33:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2112 transitions. [2023-12-02 08:33:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 08:33:23,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:23,722 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 08:33:23,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 08:33:23,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:33:24,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-12-02 08:33:24,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:33:24,323 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:33:24,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -769932827, now seen corresponding path program 1 times [2023-12-02 08:33:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:33:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965755744] [2023-12-02 08:33:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:24,324 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 08:33:24,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:33:24,325 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:33:24,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:33:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:25,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 123 conjunts are in the unsatisfiable core [2023-12-02 08:33:25,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:25,264 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 08:33:25,542 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 08:33:25,584 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:33:25,585 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 08:33:25,624 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 08:33:25,628 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 08:33:25,734 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 08:33:25,737 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 08:33:26,694 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:33:26,694 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 08:33:26,705 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 08:33:26,841 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:33:26,841 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 08:33:26,847 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 08:33:26,866 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 08:33:26,872 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 08:33:26,909 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 08:33:26,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:27,116 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 08:33:27,150 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_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-12-02 08:33:28,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (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_5764) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5763))) (let ((.cse2 (select (select .cse3 |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_5764) .cse2 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 08:33:28,592 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:33:28,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965755744] [2023-12-02 08:33:28,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965755744] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:28,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461225800] [2023-12-02 08:33:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:28,593 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:33:28,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:33:28,594 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:33:28,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 08:33:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:32,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 81 conjunts are in the unsatisfiable core [2023-12-02 08:33:32,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:32,612 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 08:33:32,620 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 08:33:33,195 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:33:33,195 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 08:33:33,205 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 08:33:33,268 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 08:33:33,272 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 08:33:33,365 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 16 treesize of output 8 [2023-12-02 08:33:33,439 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 08:33:34,304 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 08:33:34,529 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 56 treesize of output 38 [2023-12-02 08:33:34,536 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 27 treesize of output 22 [2023-12-02 08:33:34,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 08:33:34,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:33:34,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 08:33:34,796 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 08:33:34,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:35,178 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 239 treesize of output 167 [2023-12-02 08:33:42,010 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse3 (select |c_#length| v_arrayElimCell_74))) (or (bvule (bvadd (select (select (store .cse0 v_arrayElimCell_74 (store (select .cse0 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse1) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse3) (not (bvule (bvadd .cse1 (_ bv20 32)) .cse3))))) (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse1)))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_74 (store (select .cse5 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse6) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv4 32)) (bvadd .cse4 (_ bv8 32)))) (not (bvule (bvadd .cse6 (_ bv20 32)) (select |c_#length| v_arrayElimCell_74))))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse9 (select |c_#length| v_arrayElimCell_74))) (or (bvule (bvadd (select (select (store .cse7 v_arrayElimCell_74 (store (select .cse7 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse8) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse9) (not (bvule (bvadd .cse8 (_ bv20 32)) .cse9)) (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_74))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (bvadd (select (select (store .cse13 v_arrayElimCell_74 (store (select .cse13 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse12) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32))) (.cse11 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse10 .cse11) (forall ((v_ArrVal_6207 (_ BitVec 32))) (bvule .cse10 (select |c_#length| v_ArrVal_6207))) (not (bvule (bvadd .cse12 (_ bv20 32)) .cse11))))))) (forall ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse14 (select .cse15 .cse2))) (or (not (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse14))) (forall ((v_ArrVal_6207 (_ BitVec 32))) (bvule (bvadd (select (store .cse15 (bvadd (_ bv16 32) .cse14) .cse2) .cse2) (_ bv8 32)) (select |c_#length| v_ArrVal_6207))) (not (bvule (bvadd .cse14 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))))))))) is different from false [2023-12-02 08:33:42,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1461225800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:42,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227884997] [2023-12-02 08:33:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:42,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:33:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:33:42,153 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:33:42,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 08:33:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:42,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 08:33:42,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:43,060 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 08:33:43,084 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:33:43,084 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 08:33:43,269 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 08:33:43,274 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 08:33:43,643 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 08:33:43,648 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 08:33:44,722 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:33:44,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 08:33:44,729 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 08:33:45,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:33:45,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 08:33:45,143 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 08:33:45,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 08:33:45,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 08:33:45,178 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 08:33:45,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:45,236 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 08:33:45,278 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_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6738) |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 08:33:46,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6830))) (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_6831) .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6831 (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_6831) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6738) |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 08:33:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227884997] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:46,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:33:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 33 [2023-12-02 08:33:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893871658] [2023-12-02 08:33:46,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:33:46,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 08:33:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:33:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 08:33:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1291, Unknown=7, NotChecked=546, Total=1980 [2023-12-02 08:33:46,648 INFO L87 Difference]: Start difference. First operand 1506 states and 2112 transitions. Second operand has 34 states, 28 states have (on average 7.178571428571429) 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 08:34:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:30,188 INFO L93 Difference]: Finished difference Result 2432 states and 3362 transitions. [2023-12-02 08:34:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 08:34:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 7.178571428571429) 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 08:34:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:30,195 INFO L225 Difference]: With dead ends: 2432 [2023-12-02 08:34:30,195 INFO L226 Difference]: Without dead ends: 2432 [2023-12-02 08:34:30,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=278, Invalid=2395, Unknown=7, NotChecked=742, Total=3422 [2023-12-02 08:34:30,197 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 1224 mSDsluCounter, 5496 mSDsCounter, 0 mSdLazyCounter, 16285 mSolverCounterSat, 64 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 5991 SdHoareTripleChecker+Invalid, 16361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 16285 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:30,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 5991 Invalid, 16361 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 16285 Invalid, 12 Unknown, 0 Unchecked, 41.6s Time] [2023-12-02 08:34:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2023-12-02 08:34:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1720. [2023-12-02 08:34:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1295 states have (on average 1.9073359073359073) internal successors, (2470), 1680 states have internal predecessors, (2470), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 08:34:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2537 transitions. [2023-12-02 08:34:30,215 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2537 transitions. Word has length 122 [2023-12-02 08:34:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:30,216 INFO L495 AbstractCegarLoop]: Abstraction has 1720 states and 2537 transitions. [2023-12-02 08:34:30,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 7.178571428571429) 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 08:34:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2537 transitions. [2023-12-02 08:34:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 08:34:30,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:30,217 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 08:34:30,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 08:34:30,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:34:30,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 08:34:30,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:30,818 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:34:30,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715296, now seen corresponding path program 1 times [2023-12-02 08:34:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:34:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885752788] [2023-12-02 08:34:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:30,819 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 08:34:30,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:34:30,819 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:34:30,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:34:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:31,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 08:34:31,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:31,839 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 08:34:32,024 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 08:34:32,024 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 08:34:32,068 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 08:34:32,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 08:34:33,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:34:33,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 44 treesize of output 43 [2023-12-02 08:34:33,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:34:33,712 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 08:34:33,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:34:33,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 08:34:33,843 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 08:34:33,904 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 08:34:33,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:33,996 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (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_7286) |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 08:34:34,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (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_7286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 08:34:34,026 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (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~mem74#1.base| v_ArrVal_7285))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:34:34,041 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 08:34:34,523 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (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_7332))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:34:34,527 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:34:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885752788] [2023-12-02 08:34:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885752788] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [727513368] [2023-12-02 08:34:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:34,528 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:34:34,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:34:34,529 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:34:34,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-12-02 08:34:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:40,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-02 08:34:40,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:40,130 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 08:34:40,516 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 08:34:40,517 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 08:34:40,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:34:40,790 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 08:34:42,061 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:34:42,061 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 08:34:42,277 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:34:42,278 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 08:34:42,411 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:34:42,411 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 08:34:42,426 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 08:34:42,436 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 08:34:42,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:44,561 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7787 (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_7787) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 08:34:44,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (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~mem74#1.base| v_ArrVal_7786))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7787)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:34:44,592 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7786))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7787)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 08:34:45,063 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7833))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7786)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7787)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 08:34:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [727513368] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674520103] [2023-12-02 08:34:45,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:45,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:45,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:34:45,068 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:34:45,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 08:34:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:45,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 08:34:45,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:45,976 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:34:45,977 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 08:34:46,033 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 08:34:46,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:34:46,857 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 08:34:46,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:34:46,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 08:34:47,071 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:34:47,072 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 08:34:47,160 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 08:34:47,165 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 08:34:47,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:47,189 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 08:34:47,190 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 08:34:47,362 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (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_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 08:34:47,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8285)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 08:34:47,388 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (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_8285))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 08:34:47,901 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8332))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8285)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 08:34:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674520103] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:47,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:34:47,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 32 [2023-12-02 08:34:47,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156631838] [2023-12-02 08:34:47,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:34:47,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 08:34:47,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:34:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 08:34:47,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1090, Unknown=34, NotChecked=1040, Total=2352 [2023-12-02 08:34:47,906 INFO L87 Difference]: Start difference. First operand 1720 states and 2537 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 08:35:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:03,477 INFO L93 Difference]: Finished difference Result 2105 states and 3047 transitions. [2023-12-02 08:35:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 08:35:03,477 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 08:35:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:03,481 INFO L225 Difference]: With dead ends: 2105 [2023-12-02 08:35:03,481 INFO L226 Difference]: Without dead ends: 2105 [2023-12-02 08:35:03,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 344 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=269, Invalid=1729, Unknown=34, NotChecked=1274, Total=3306 [2023-12-02 08:35:03,483 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 755 mSDsluCounter, 4696 mSDsCounter, 0 mSdLazyCounter, 6600 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 5077 SdHoareTripleChecker+Invalid, 6642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 6600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:03,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 5077 Invalid, 6642 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 6600 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2023-12-02 08:35:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2023-12-02 08:35:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1719. [2023-12-02 08:35:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1295 states have (on average 1.9057915057915058) internal successors, (2468), 1679 states have internal predecessors, (2468), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 08:35:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2535 transitions. [2023-12-02 08:35:03,500 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2535 transitions. Word has length 124 [2023-12-02 08:35:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:03,501 INFO L495 AbstractCegarLoop]: Abstraction has 1719 states and 2535 transitions. [2023-12-02 08:35:03,501 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 08:35:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2535 transitions. [2023-12-02 08:35:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 08:35:03,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:03,501 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 08:35:03,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:35:03,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2023-12-02 08:35:03,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-12-02 08:35:04,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:04,102 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:35:04,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715295, now seen corresponding path program 1 times [2023-12-02 08:35:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:35:04,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647574030] [2023-12-02 08:35:04,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:04,103 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 08:35:04,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:35:04,104 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:35:04,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:35:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:05,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 08:35:05,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:05,203 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 08:35:05,589 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 08:35:05,637 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:35:05,637 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 08:35:05,682 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 08:35:05,690 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 08:35:05,830 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 08:35:05,835 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 08:35:06,990 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:35:06,990 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 08:35:06,996 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 08:35:07,153 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:35:07,154 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 08:35:07,161 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 08:35:07,271 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:35:07,271 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 08:35:07,276 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 08:35:07,296 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 08:35:07,303 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 08:35:07,347 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 08:35:07,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:35:07,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 08:35:07,596 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_8835 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 08:35:07,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8832))) (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_8833) .cse0 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (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_8833) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8835) |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 08:35:07,679 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_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8832))) (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_8833) .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8833) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8835) |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 08:35:11,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8926))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8832))) (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_8927) .cse0 v_ArrVal_8833) .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (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_8926))) (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_8927) .cse6 v_ArrVal_8833) (select (select (store .cse7 .cse6 v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8835))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 08:35:11,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:35:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647574030] [2023-12-02 08:35:11,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647574030] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:35:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1848784751] [2023-12-02 08:35:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:11,150 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:35:11,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:35:11,151 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:35:11,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-12-02 08:37:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:01,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 08:37:01,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:01,764 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 08:37:02,410 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 08:37:02,467 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:37:02,467 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 08:37:02,491 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 08:37:02,505 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 08:37:02,627 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 08:37:02,635 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 08:37:04,357 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:37:04,357 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 08:37:04,365 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 08:37:04,540 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:37:04,541 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 08:37:04,563 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 08:37:04,669 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:37:04,669 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 08:37:04,678 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 08:37:04,719 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 08:37:04,734 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 08:37:04,743 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 08:37:04,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:37:04,826 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9430) |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_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 08:37:04,874 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_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-12-02 08:37:04,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (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_9428) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9427))) (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~mem74#1.base| v_ArrVal_9428) .cse2 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 08:37:04,992 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_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9427))) (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_9428) .cse1 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9428) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9430) |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 08:37:06,960 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9522))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9427))) (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_9521) .cse0 v_ArrVal_9428) .cse1 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (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_9522))) (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_9521) .cse6 v_ArrVal_9428) (select (select (store .cse7 .cse6 v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9430))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 08:37:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1848784751] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:37:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731247795] [2023-12-02 08:37:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:06,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:37:06,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:37:06,975 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:37:06,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-12-02 08:37:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:07,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 122 conjunts are in the unsatisfiable core [2023-12-02 08:37:07,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:08,163 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 08:37:08,214 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:37:08,214 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 08:37:08,352 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 08:37:08,375 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 08:37:08,724 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 08:37:08,732 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 08:37:10,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:37:10,461 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 08:37:10,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 08:37:10,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:37:10,816 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 08:37:10,839 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 08:37:11,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:37:11,058 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 08:37:11,082 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 08:37:11,104 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 08:37:11,118 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 08:37:11,127 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 08:37:11,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:37:11,204 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10024) |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_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 08:37:11,256 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_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 08:37:11,620 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (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_10022) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10021))) (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~mem74#1.base| v_ArrVal_10022) .cse2 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 08:37:11,721 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_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10021))) (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_10022) .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10022) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 08:37:13,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10116 (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_10115))) (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_10116) .cse1 v_ArrVal_10022) (select (select (store .cse2 .cse1 v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10024))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10115))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10021))) (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_10116) .cse4 v_ArrVal_10022) .cse5 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 08:37:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731247795] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:37:13,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:37:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2023-12-02 08:37:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342360515] [2023-12-02 08:37:13,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:37:13,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 08:37:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:37:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 08:37:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=492, Unknown=15, NotChecked=870, Total=1482 [2023-12-02 08:37:13,504 INFO L87 Difference]: Start difference. First operand 1719 states and 2535 transitions. Second operand has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 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 08:37:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:37:54,362 INFO L93 Difference]: Finished difference Result 2415 states and 3348 transitions. [2023-12-02 08:37:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 08:37:54,363 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 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 08:37:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:37:54,366 INFO L225 Difference]: With dead ends: 2415 [2023-12-02 08:37:54,366 INFO L226 Difference]: Without dead ends: 2415 [2023-12-02 08:37:54,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 351 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=178, Invalid=923, Unknown=15, NotChecked=1140, Total=2256 [2023-12-02 08:37:54,367 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 1128 mSDsluCounter, 4033 mSDsCounter, 0 mSdLazyCounter, 10305 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 4651 SdHoareTripleChecker+Invalid, 10330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 10305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:37:54,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 4651 Invalid, 10330 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 10305 Invalid, 0 Unknown, 0 Unchecked, 39.7s Time] [2023-12-02 08:37:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2023-12-02 08:37:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1718. [2023-12-02 08:37:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1295 states have (on average 1.9042471042471043) internal successors, (2466), 1678 states have internal predecessors, (2466), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 08:37:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2533 transitions. [2023-12-02 08:37:54,385 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2533 transitions. Word has length 124 [2023-12-02 08:37:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:37:54,386 INFO L495 AbstractCegarLoop]: Abstraction has 1718 states and 2533 transitions. [2023-12-02 08:37:54,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 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 08:37:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2533 transitions. [2023-12-02 08:37:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 08:37:54,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:37:54,386 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 08:37:54,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Ended with exit code 0 [2023-12-02 08:37:54,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2023-12-02 08:37:54,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:37:54,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:37:54,987 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:37:54,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:37:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384054, now seen corresponding path program 1 times [2023-12-02 08:37:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:37:54,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524052201] [2023-12-02 08:37:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:37:54,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 08:37:54,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:37:54,989 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:37:54,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:37:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:37:56,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 08:37:56,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:37:56,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 08:37:56,671 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 08:37:56,671 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 08:37:56,756 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 08:37:56,958 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 08:37:59,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:37:59,262 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 08:37:59,502 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:37:59,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 08:37:59,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:37:59,699 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 08:37:59,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:37:59,912 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 08:37:59,937 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 08:38:00,048 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 08:38:00,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:38:00,227 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10587) |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 08:38:00,251 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10587 (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_10587) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 08:38:00,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (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_10586))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:38:00,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:38:00,337 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (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~mem74#1.base| v_ArrVal_10585))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:38:00,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (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_10585))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:38:01,073 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10633))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10585)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 08:38:01,080 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:38:01,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524052201] [2023-12-02 08:38:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524052201] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:38:01,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [486901229] [2023-12-02 08:38:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:38:01,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:38:01,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:38:01,081 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:38:01,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-12-02 08:38:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:38:09,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 08:38:09,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:38:09,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 08:38:10,273 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 08:38:10,273 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 08:38:10,426 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 08:38:10,791 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 08:38:12,792 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:38:12,793 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 08:38:13,166 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:38:13,166 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 08:38:13,417 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:38:13,417 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 08:38:13,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:38:13,667 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 08:38:13,690 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 08:38:13,710 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 08:38:13,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:38:15,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11104 (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_11104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 08:38:15,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (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_11103))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 08:38:17,318 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (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_11102))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 08:38:17,345 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (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_11102))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 08:38:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [486901229] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:38:18,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093463731] [2023-12-02 08:38:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:38:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:38:18,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:38:18,312 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:38:18,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-12-02 08:38:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:38:19,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 08:38:19,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:38:19,144 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 08:38:19,590 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:38:19,590 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 08:38:19,722 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 08:38:21,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:38:21,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 08:38:21,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:38:21,603 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 08:38:21,825 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:38:21,825 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 08:38:22,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:38:22,269 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 08:38:22,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 08:38:22,307 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 08:38:22,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:38:24,547 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 08:38:24,547 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 08:38:24,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (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~mem75#1.base| v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem75#1.base|)) is different from false [2023-12-02 08:38:24,586 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32)))) (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))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11619))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 08:38:24,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11618)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2023-12-02 08:38:24,633 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11618))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_11619))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 08:38:25,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093463731] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:38:25,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:38:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 35 [2023-12-02 08:38:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578695295] [2023-12-02 08:38:25,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:38:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 08:38:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:38:25,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 08:38:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1413, Unknown=52, NotChecked=1380, Total=3080 [2023-12-02 08:38:25,639 INFO L87 Difference]: Start difference. First operand 1718 states and 2533 transitions. Second operand has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 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 08:39:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:39:04,349 INFO L93 Difference]: Finished difference Result 2103 states and 3043 transitions. [2023-12-02 08:39:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 08:39:04,350 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 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 08:39:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:39:04,353 INFO L225 Difference]: With dead ends: 2103 [2023-12-02 08:39:04,353 INFO L226 Difference]: Without dead ends: 2103 [2023-12-02 08:39:04,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 348 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=317, Invalid=2135, Unknown=58, NotChecked=1650, Total=4160 [2023-12-02 08:39:04,355 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 746 mSDsluCounter, 7503 mSDsCounter, 0 mSdLazyCounter, 10329 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 7883 SdHoareTripleChecker+Invalid, 10370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 10329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:39:04,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 7883 Invalid, 10370 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 10329 Invalid, 0 Unknown, 0 Unchecked, 37.4s Time] [2023-12-02 08:39:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2023-12-02 08:39:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1717. [2023-12-02 08:39:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1295 states have (on average 1.9027027027027028) internal successors, (2464), 1677 states have internal predecessors, (2464), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 08:39:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2531 transitions. [2023-12-02 08:39:04,381 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2531 transitions. Word has length 126 [2023-12-02 08:39:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:39:04,381 INFO L495 AbstractCegarLoop]: Abstraction has 1717 states and 2531 transitions. [2023-12-02 08:39:04,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 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 08:39:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2531 transitions. [2023-12-02 08:39:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 08:39:04,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:39:04,382 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 08:39:04,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2023-12-02 08:39:04,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:39:04,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2023-12-02 08:39:04,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 08:39:04,983 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 08:39:04,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:39:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384055, now seen corresponding path program 1 times [2023-12-02 08:39:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:39:04,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523138881] [2023-12-02 08:39:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:39:04,984 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 08:39:04,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:39:04,985 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:39:04,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 08:39:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:39:06,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-02 08:39:06,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:39:06,253 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 08:39:06,932 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 08:39:07,006 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:39:07,007 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 08:39:07,090 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 08:39:07,104 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 08:39:07,346 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 08:39:07,354 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 08:39:09,154 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:39:09,154 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 08:39:09,173 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 08:39:09,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:39:09,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 08:39:09,443 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 08:39:09,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:39:09,626 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 08:39:09,644 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 08:39:09,834 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:39:09,835 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 08:39:09,843 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 08:39:09,881 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 08:39:09,889 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 08:39:09,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 08:39:09,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:39:10,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2023-12-02 08:39:10,332 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_12186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 08:39:10,453 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (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_12184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12183))) (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_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 08:39:10,639 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_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12184) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12183))) (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_12184) .cse3 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 08:39:10,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (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_12181))) (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_12182) .cse1 v_ArrVal_12184) (select (select (store .cse2 .cse1 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12181))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12183))) (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_12182) .cse4 v_ArrVal_12184) .cse5 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 08:39:10,909 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_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12181))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12183))) (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_12182) .cse1 v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12181))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12182) .cse7 v_ArrVal_12184) (select (select (store .cse8 .cse7 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))) |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 08:39:15,036 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12277))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12181))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12183))) (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_12278) .cse0 v_ArrVal_12182) .cse1 v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (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_12277))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12181))) (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_12278) .cse8 v_ArrVal_12182) .cse9 v_ArrVal_12184) (select (select (store .cse10 .cse9 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))))) |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 08:39:15,072 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:39:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523138881] [2023-12-02 08:39:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523138881] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:39:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [117989078] [2023-12-02 08:39:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:39:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:39:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:39:15,073 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:39:15,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process [2023-12-02 08:42:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:42:14,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-02 08:42:14,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:42:14,126 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 08:42:16,418 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 08:42:16,619 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:42:16,619 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 08:42:16,667 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 08:42:16,712 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 08:42:17,112 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 08:42:17,135 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 08:42:22,583 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:42:22,583 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 08:42:22,607 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 08:42:23,118 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:42:23,118 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 08:42:23,163 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 08:42:23,492 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:42:23,493 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 08:42:23,560 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 08:42:23,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:42:23,848 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 08:42:23,915 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 08:42:23,985 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 08:42:24,009 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 08:42:24,033 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 08:42:24,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:42:24,230 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 08:42:24,346 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_12798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 08:42:24,522 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (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_12796) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12795))) (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_12796) .cse2 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 08:42:24,753 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_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12796) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12795))) (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_12796) .cse3 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 08:42:24,970 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (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_12793))) (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_12794) .cse1 v_ArrVal_12796) (select (select (store .cse2 .cse1 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12798))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12793))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12795))) (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_12794) .cse4 v_ArrVal_12796) .cse5 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 08:42:25,138 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12793))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12794) .cse2 v_ArrVal_12796) (select (select (store .cse3 .cse2 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12798))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12793))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_12795))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12794) .cse5 v_ArrVal_12796) .cse6 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 08:42:31,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12890))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12793))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12795))) (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_12889) .cse0 v_ArrVal_12794) .cse1 v_ArrVal_12796) .cse2 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (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_12890))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12793))) (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_12889) .cse8 v_ArrVal_12794) .cse9 v_ArrVal_12796) (select (select (store .cse10 .cse9 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12798))))) |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 08:42:31,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [117989078] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:42:31,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94996664] [2023-12-02 08:42:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:42:31,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:42:31,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:42:31,132 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:42:31,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70a0178-67a9-4fa8-8fff-908acb484ce7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2023-12-02 08:42:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:42:32,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 08:42:32,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:42:33,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 5 [2023-12-02 08:42:34,156 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:42:34,156 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 08:42:34,718 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 08:42:34,776 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 08:42:36,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 22 treesize of output 10 [2023-12-02 08:42:36,076 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 08:42:43,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:42:43,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 08:42:43,034 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 08:42:44,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:42:44,376 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 08:42:44,407 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 08:42:45,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:42:45,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 62 treesize of output 57 [2023-12-02 08:42:45,390 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 08:42:46,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 08:42:46,243 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 08:42:46,330 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 08:42:46,390 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 08:42:46,445 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 08:42:46,474 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 08:42:46,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:42:46,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_13408) |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_13409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 08:42:46,858 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_13408 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_13409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 08:42:47,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_13406))) (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~mem75#1.base| v_ArrVal_13407) .cse0 v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_13409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_13407) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_13406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 08:42:47,167 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_13409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13406))) (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_13407) .cse1 v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_13409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13407) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13408) |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 08:42:48,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (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_13404))) (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_13405) .cse1 v_ArrVal_13407) (select (select (store .cse2 .cse1 v_ArrVal_13406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_13408))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_13404))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_13406))) (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_13405) .cse4 v_ArrVal_13407) .cse5 v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_13409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 08:42:49,041 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_13409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13404))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_13406))) (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_13405) .cse1 v_ArrVal_13407) .cse2 v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_13409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13404))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13405) .cse7 v_ArrVal_13407) (select (select (store .cse8 .cse7 v_ArrVal_13406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_13408))) |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 08:42:55,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_13501))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_13404))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_13500) .cse1 v_ArrVal_13405) .cse2 v_ArrVal_13407) (select (select (store .cse3 .cse2 v_ArrVal_13406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_13408))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_13501))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_13404))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_13406))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_13500) .cse6 v_ArrVal_13405) .cse7 v_ArrVal_13407) .cse8 v_ArrVal_13408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_13409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 08:42:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94996664] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:42:55,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:42:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2023-12-02 08:42:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795372436] [2023-12-02 08:42:55,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:42:55,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 08:42:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:42:55,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 08:42:55,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=586, Unknown=21, NotChecked=1428, Total=2162 [2023-12-02 08:42:55,626 INFO L87 Difference]: Start difference. First operand 1717 states and 2531 transitions. Second operand has 24 states, 20 states have (on average 7.0) internal successors, (140), 20 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)